David M. R. Park. The Y-combinator in Scott's lambda-calculus models. Symposium on Theory of Programming, University of Warwick, unpublished; cited in [6], 1970. Basic Research in Computer Science (http://www.brics.dk/), Centre of the Danish National Research Foundation. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Strong Stability and the Incompleteness of Stable Models for - Calculus Olivier Bastonero (Correct)
....2 ag: Furthermore D(H) is extensional iff i is surjective. Proof. Let Phi a be the strongly stable function whose trace is i Gamma (a) We have (a)b = Phi a (b) fff 2 D ; 9h b; h; ff) 2 Tr ( Phi a )g = fff 2 D ; 9h b; i(h; ff) 2 ag: 2 3 Park s strongly stable model The Park model [20] was first defined in the framework of continuous semantics. It is a variant of the Scott model D1 [22] but with a very different equational theory (the model is not semi sensible) This model has a stable analogue (which was defined by Honsell and Ronchi della Rocca [13] and a strongly ....
D. Park, The Y -Combinator in Scott's Lambda Calculus Models, Theory of Computation Report, 13, Dept. of Computer Science, University of Warwick, 1976.
Three Inadequate Models - Plotkin (Correct)
....to this language D # = D # D)# N # and its standard solution is adequate. We give a non standard solution to the domain equation which is not adequate, confirming that some restriction in the class of models is needed for adequacy. The idea of the construction dates back to Park [Par76], who gave a non standard model of the pure untyped # calculus in which the paradoxical combinator does not denote the least fixed point operator. # Division of Informatics, University of Edinburgh, King s Buildings, Edinburgh EH9 3JZ, UK; phone: 44 131 650 5158, e mail: gdp dcs.ed.ac.uk. One ....
....of the language at hand satisfy the predicate. We do not give any general formulation of such a lemma here; we rather content ourselves with stating the required version in each case, omitting the routine proof by structural induction. 10 3 The First Inadequate Model As already remarked, in [Par76] Park showed that in non standard models of the untyped # calculus the paradoxical combinator need not denote the least fixed point operator. Now while Y may not be the least fixed point operator semantically, it is syntactically, and we will show that inadequacy can result from this di#erence ....
D. Park, the Y-Combinator in Scott's Lambda-Calculus Models, Theory of Computation Report No. 13, Department of Computer Science, Warwick University, 1976.
What do Types Mean? - From Intrinsic to Extrinsic Semantics - Reynolds (2001) (Correct)
No context found.
David M. R. Park. The Y-combinator in Scott's lambda-calculus models. Symposium on Theory of Programming, University of Warwick, unpublished; cited in [6], 1970. Basic Research in Computer Science (http://www.brics.dk/), Centre of the Danish National Research Foundation.
The Meaning of Types - From Intrinsic to Extrinsic Semantics - Reynolds (2000) (Correct)
No context found.
David M. R. Park. The Y-combinator in Scott's lambda-calculus models. Symposium on Theory of Programming, University of Warwick, unpublished; cited in [8], 1970.
Building continuous webbed models for System F - Berardi, Berline (2000) (1 citation) (Correct)
No context found.
D. Park, The Y combinator in Scott's Lambda-calculus models, Theory of Computation report 13, Department of Computer Science, University of Warwick, 1976. 34
Building continuous webbed models for System F - Berardi, Berline (1998) (1 citation) (Correct)
No context found.
D. Park, The Y combinator in Scott's Lambda-calculus models, Theory of Computation report 13, Department of Computer Science, University of Warwick, 1976.
Formal Methods - Selected Historical References - Jones, McCauley (1992) (1 citation) (Correct)
No context found.
D. Park. The Y-combinator in Scott's lambda-calculus model. Symposium on Theory of Programming, University of Warwick. Unpublished, 1970.
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