scientific article; zbMATH DE number 234028
From MaRDI portal
Publication:5287527
zbMATH Open0814.68085MaRDI QIDQ5287527FDOQ5287527
Authors: Pierre-Louis Curien 
Publication date: 9 July 1993
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Categorical logic, topoi (03G30) Semantics in the theory of computing (68Q55)
Cited In (33)
- Type similarity for the Lambek-Grishin calculus revisited
- Prelogical relations
- A relative PCF-definability result for strongly stable functions and some corollaries
- Musings around the geometry of interaction, and coherence
- Languages and logical definability in concurrency monoids
- Degrees of parallelism in the continuous type hierarchy
- A semantics for nabla
- Title not available (Why is that?)
- On the enumeration of closures and environments with an application to random generation
- Glueing and orthogonality for models of linear logic
- The largest cartesian closed category of stable domains
- Games and full abstraction for FPC.
- Concrete data structures and functional parallel programming
- Simply typed lambda calculus with first-class environments
- Refunctionalization at work
- New developments in environment machines
- Higher order unification via explicit substitutions
- Full abstraction for PCF
- Lambda calculus with explicit recursion
- Confluence theory for graphs
- Infinitary lambda calculus
- Stable bistructure models of PCF (preliminary draft)
- Applications of infinitary lambda calculus
- Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
- The sequentially realizable functionals
- Definability and full abstraction
- A stable programming language
- Mechanizing logical relations
- Interaction nets with McCarthy's \(\mathsf{amb}\)
- Bistructures, bidomains and linear logic
- Title not available (Why is that?)
- On the expressive power of first-order boolean functions in PCF
- Descendants and origins in term rewriting.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287527)
