scientific article; zbMATH DE number 234028
From MaRDI portal
Publication:5287527
Recommendations
Cited in
(33)- Prelogical relations
- Type similarity for the Lambek-Grishin calculus revisited
- A relative PCF-definability result for strongly stable functions and some corollaries
- Musings around the geometry of interaction, and coherence
- Degrees of parallelism in the continuous type hierarchy
- Languages and logical definability in concurrency monoids
- scientific article; zbMATH DE number 1531361 (Why is no real title available?)
- A semantics for nabla
- On the enumeration of closures and environments with an application to random generation
- The largest cartesian closed category of stable domains
- Glueing and orthogonality for models of linear logic
- Games and full abstraction for FPC.
- Concrete data structures and functional parallel programming
- Simply typed lambda calculus with first-class environments
- Refunctionalization at work
- Higher order unification via explicit substitutions
- New developments in environment machines
- Full abstraction for PCF
- Lambda calculus with explicit recursion
- Infinitary lambda calculus
- Confluence theory for graphs
- 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
- scientific article; zbMATH DE number 4048997 (Why is no real title available?)
- 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)
