Constructing type systems over an operational semantics
- 31 July 1992
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 14 (1) , 71-84
- https://doi.org/10.1016/0747-7171(92)90026-z
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Computational foundations of basic recursive function theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The semantics of second-order lambda calculusInformation and Computation, 1990
- The calculus of constructionsInformation and Computation, 1988
- An interpretation of Martin-Löf's type theory in a type-free theory of propositionsThe Journal of Symbolic Logic, 1984
- Curry's type-rules are complete with respect to the F-semantics tooTheoretical Computer Science, 1983
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- Recursive models for constructive set theoriesAnnals of Mathematical Logic, 1982
- On the Semantics of “Data Type”SIAM Journal on Computing, 1979
- Intensional interpretations of functionals of finite type IThe Journal of Symbolic Logic, 1967