Full Abstraction by Translation (1996)

by Guy Mccusker
Venue:Proc., 3rd Workshop in Theory and Formal Methods
Citations:5 - 0 self

Documents Related by Co-Citation

49 Games and full abstraction for a functional metalanguage with recursive types – G McCusker - 1996
88 Categorical Logic – Andrew M. Pitts - 1995
239 Formal Semantics of Programming Languages – Glynn Winskel
104 Proofs and Types. Cambridge Tracts – J-Y Girard, Y Lafont, P Taylor - 1989
60 Locus solum: From the rules of logic to the logic of rules – Jean-Yves Girard
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
427 Introduction to Higher Order Categorical Logic – J Lambek, P Scott - 1986
28 Lectures on Predomains and Partial Functions. Notes for a course at CSLI – G D Plotkin - 1985
99 Relational Properties of Domains – Andrew M. Pitts - 1996
12 Separating concurrent languages with categories of language embeddings – Ehud Shapiro - 1991
75 Parametric Polymorphism and Operational Equivalence – Andrew M. Pitts - 2000
132 On the Expressive Power of Programming Languages – Matthias Felleisen - 1990
110 Fully abstract models of typed lambda calculi – R Milner - 1977
26 Testing equivalences for processes. Theoret – R De Nicola, M Hennessy - 1984
22 Fully abstract translations between functional languages – J G Riecke - 1991
14 A non-deterministic call-by-need lambda calculus – Arne Kutzner, Manfred Schmidt-Schauß - 1998
11 Must Preorder in Non-Deterministic Untyped λ-calculus – U. de'Liguoro, A. Piperno - 1992
5 A fully abstract translation between a lambda-calculus with reference types and – E Ritter, A M Pitts - 1995
15 A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations – David Sabel, Manfred Schmidt-schauß - 2008