Full abstraction in the lazy lambda calculus
From MaRDI portal
Recommendations
Cited in
(88)- Discrimination by parallel observers: the algorithm.
- From Böhm's theorem to observational equivalences: an informal account
- Strong normalization from an unusual point of view
- A fully abstract model for mobile ambients
- Logical semantics for stability
- On the observational theory of the CPS-calculus
- A co-induction principle for recursively defined domains
- Minimal relative normalization in orthogonal expression reduction systems
- RPO, Second-Order Contexts, and λ-Calculus
- Adapting innocent game models for the Böhm tree \(\lambda\)-theory
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi
- A first order logic of effects
- Infinitary lambda calculi and böhm models
- Compositional characterisations of \(\lambda\)-terms using intersection types
- From rewrite rules to bisimulation congruences
- Full abstraction for lambda calculus with resources and convergence testing
- A lambda-calculus for dynamic binding
- Unfixing the fixpoint: the theories of the \(\lambda Y\)-calculus
- Recursive Domain Equations of Filter Models
- Bisimulations for delimited-control operators
- Lazy logical semantics
- A fully abstract may testing semantics for concurrent objects
- Domain theory for concurrency
- A logical approach to stable domains
- Proving soundness of extensional normal-form bisimilarities
- Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax
- scientific article; zbMATH DE number 2061712 (Why is no real title available?)
- Algebraic interpretation of lambda calculus with resources
- Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings
- A calculus of mobile processes. I
- The infinitary lambda calculus of the infinite eta Böhm trees
- Fully abstract encodings of \(\lambda\)-calculus in HOcore through abstract machines
- Parametric parameter passing \(\lambda\)-calculus
- Intersection types for \(\lambda\)-trees
- Observational program calculi and the correctness of translations
- On applicative similarity, sequentiality, and full abstraction
- Infinite \(\lambda\)-calculus and types
- scientific article; zbMATH DE number 16188 (Why is no real title available?)
- Games characterizing Levy-Longo trees
- Small-step and big-step semantics for call-by-need
- A Fresh Look at the λ-Calculus
- Infinitary lambda calculus
- Logical equivalence for subtyping object and recursive types
- Comparing higher-order encodings in logical frameworks and tile logic
- Lazy lambda calculus: theories, models and local structure characterization (extended abstract)
- A fully abstract denotational semantics for the \(\pi\)-calculus
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- (Towards a) statistical probabilistic lazy lambda calculus
- Developing (meta)theory of \(\lambda\)-calculus in the theory of contexts
- Applications of infinitary lambda calculus
- On the characterization of models of \(\mathcal H^\ast\): the semantical aspect
- Proof, meaning and paradox: some remarks
- scientific article; zbMATH DE number 176136 (Why is no real title available?)
- Infinitary lambda calculus and discrimination of Berarducci trees.
- Program equivalence in an untyped, call-by-value functional language with uncurried functions
- On the characterization of models of \(\mathcal{H}^*\)
- A bisimulation for dynamic sealing
- Fairness and communication-based semantics for session-typed languages
- Intersection types and computational rules
- Light genericity
- Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
- scientific article; zbMATH DE number 1479607 (Why is no real title available?)
- An abstract framework for environment machines
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- Towards lambda calculus order-incompleteness
- Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
- A class of bounded functions, a database language and an extended lambda calculus
- Highlights in infinitary rewriting and lambda calculus
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- Smaller Abstractions for ∀CTL* without Next
- The lazy lambda calculus in a concurrency scenario
- A categorical framework for congruence of applicative bisimilarity in higher-order languages
- Intersection types and lambda models
- An irregular filter model
- Parametric \(\lambda \)-theories
- Full abstraction and the Context Lemma (preliminary report)
- Labelled reductions, runtime errors, and operational subsumption
- Coalgebraic description of generalised binary methods
- Full Abstraction and the Context Lemma
- Simple easy terms
- Semantical analysis of perpetual strategies in -calculus
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- scientific article; zbMATH DE number 1722650 (Why is no real title available?)
- Clocked lambda calculus
- Game semantics and linear CPS interpretation
- Behavioural inverse limit \(\lambda\)-models
- Call-by-value Solvability
- Descendants and origins in term rewriting.
This page was built for publication: Full abstraction in the lazy lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261291)
