J.L. Krivine, Lambda-calculus, types and models, Ellis-Horwood, 1993. (augmented english translation of the above). 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)
....retraction pairs, namely (Q; AP ) and (Lambda; Appl) 18 First ( forces ap q = id, second ( plus the direction ) of ( force ap(u) v) to be a clique ; nally, the direction ( of ( forces q(f) to be a clique. 19 This is not true in the stable semantics (see for example [16] or [19]) 16 4 Webbed models for F . We start from a web of the form : mhom ; m coh ; hom ; coh ; j hom ; j hcoh ) where is a set, followed by two re exive and symmetric relations, two preorders, and two functions. The relations mhom and m coh are called respectively homogeneity and ....
J.L. Krivine, Lambda-calculus, types and models, Ellis-Horwood, 1993. (augmented english translation of the above).
Building continuous webbed models for System F - Berardi, Berline (1998) (1 citation) (Correct)
....sight but they are quite natural in the light of the preliminaries of Section 3. They are furthermore easy to fulll, as show the examples in Section 5 (the reader might have a look at these models before proceeding further) 20 This is not true in the stable semantics (see for example [16] or [19]) 16 4.1 Denition of Types, types; Q and AP . Types will be a prime algebraic Scott domain, whose elements are prime algebraic Scott domains. Types will be isomorphic to some S(W ) called types; and hence will be prime algebraic, but Types is not of the form S(W 0 ) The rst requirements ....
J.L. Krivine, Lambda-calculus, types and models, Ellis-Horwood, 1993. (augmented english translation of the above).
A presentation of the Curry-Howard Correspondance. - Berline (1997) (1 citation) (Correct)
.... typed calculi, for their interest from mathematical, computational and metamathematical points of view, and for the connections with existing programming languages (at that moment) see [6] For a clear exposition of the notion of icontrol operatorsj we refer to the rst pages 4 of [5] Finally, [15] gives the mathematical justications of the (intuitionistic) programming with proofs paradigm (with no comments) ....
J.L. Krivine, Lambda-calculus, types and models, Ellis-Horwood, 1993. (augmented english translation of the above).
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