Conditional lambda-theories and the verification of static properties of programs
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 321-332
- https://doi.org/10.1109/lics.1990.113758
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A short proof of the lexical addressing algorithmInformation Processing Letters, 1990
- Incorporating static analysis in a combinator-based compilerInformation and Computation, 1989
- Continuation-passing, closure-passing stylePublished by Association for Computing Machinery (ACM) ,1989
- Loops in combinator-based compilersInformation and Control, 1983
- Deriving Target Code as a Representation of Continuation SemanticsACM Transactions on Programming Languages and Systems, 1982
- What is a model of the lambda calculus?Information and Control, 1982
- Semantics-directed machine architecturePublished by Association for Computing Machinery (ACM) ,1982
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940