Logical Relations for PCF
From MaRDI portal
- A visual procedure for optimal response transformations and curvature specifications
- Automata, languages and programming. 2nd colloquium, University of Saarbrücken, July 29-August 2, 1974
- Computational adequacy via ‘mixed’ inductive definitions
- Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Constructing Call-by-Value Continuation Semantics
- Data Types as Lattices
- Fast and loose reasoning is morally correct
- Formal SOS-Proofs for the Lambda-Calculus
- Formal verification of monad transformers
- HOLCF = HOL + LCF
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- International symposium on programming. 5th Colloquium, Turin, April 6-8, 1982. Proceedings
- LCF considered as a programming language
- Mechanizing logical relations
- More Church-Rosser proofs (in Isabelle/HOL)
- On Proving Limiting Completeness
- On the relations between monadic semantics
- Proof Pearl: De Bruijn Terms Really Do Work
- Relating models of backtracking
- Relational properties of domains
- Small bisimulations for reasoning about higher-order imperative programs
- Some Domain Theory and Denotational Semantics in Coq
- Theorem proving in higher order logics. 20th international conference, TPHOLs 2007, Kaiserslautern, Germany, September 10--13, 2007. Proceedings
- Theorem proving in higher order logics. 22nd international conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings
- Winskel is (almost) right: Towards a mechanized semantics textbook
This page was built for software: Logical Relations for PCF
