A. Simpson, Categorical completeness results for the simply-typed - calculus, in : M. Dezani-Ciancaglini and G. Plotkin eds., Lecture Notes in Computer Science vol. 902, TLCA'95, p.414-427, Springer Verlag, Berlin, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Building continuous webbed models for System F - Berardi, Berline (2000) (1 citation) (Correct)
....but is not extensional. The interest of trying to answer this latter conjecture is that, whatever the answer will be, it will force us to better understand completeness, and hopefully to nd less technical conditions than the ones which are proposed in [5] in the same sense that Simpson s paper [34] is progress with respect to Friedman s one [13] 5.1 The square models. De nition 10 A square model is a webbed model of the form( m; m; j; j) where M : m; j) is a re exive prime web. A necessary and su cient condition for a re exive prime web M to give rise to a ....
A. Simpson, Categorical completeness results for the simply-typed - calculus, in : M. Dezani-Ciancaglini and G. Plotkin eds., Lecture Notes in Computer Science vol. 902, TLCA'95, p.414-427, Springer Verlag, Berlin, 1995.
βη-complete models for System F - Berardi, Berline (2000) (Correct)
....[26] for modelling parallelism(see [13] and greater cardinals are used for foundational purposes ( 14] 10] 5 term models. The term model of System F was the only complete model of F known up to now. For typed calculus, the problem has been tackled by H. Friedman [15] and then A. Simpson [29]) for the simply typed calculus (see below) Concerning untyped calculus, the problem of nding a nonsyntactical complete model has only been solved recently, by Di Gianantonio, Honsell, Plotkin [13] several interesting related questions being however left open by their result and proof (see ....
....variables are in fact a (trivial) example of very generic maps. In Friedman s proof, full models distinguish between nonconvertible terms by applying them to very generic maps, built by the Axiom of Choice (of Set Theory) Another possibility for having completeness was discovered by Simpson [29], by building on a syntactic result of Statman [32] Simpson proved that all models of simply typed calculus, which include integers in the base type, and sum and product over such integers, are complete. In this case, the completeness uses as starting point a strong property of sum and product: ....
[Article contains additional citation context not shown here]
A. Simpson, Categorical completeness results for the simply-typed - calculus, in : M. Dezani-Ciancaglini and G. Plotkin eds., Lecture Notes in Computer Science vol. 902, TLCA'95, p.414-427, Springer Verlag, Berlin, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC