scientific article; zbMATH DE number 234028
From MaRDI portal
Publication:5287527
zbMath0814.68085MaRDI QIDQ5287527
Publication date: 9 July 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatory logic and lambda calculus (03B40)
Related Items (31)
Mechanizing logical relations ⋮ On the enumeration of closures and environments with an application to random generation ⋮ Simply typed lambda calculus with first-class environments ⋮ Lambda calculus with explicit recursion ⋮ Stable bistructure models of PCF ⋮ Degrees of parallelism in the continuous type hierarchy ⋮ Infinitary lambda calculus ⋮ Glueing and orthogonality for models of linear logic ⋮ Refunctionalization at work ⋮ Bistructures, bidomains and linear logic ⋮ Unnamed Item ⋮ The largest cartesian closed category of stable domains ⋮ Confluence theory for graphs ⋮ Type Similarity for the Lambek-Grishin Calculus Revisited ⋮ Musings around the geometry of interaction, and coherence ⋮ New Developments in Environment Machines ⋮ Concrete data structures and functional parallel programming ⋮ A stable programming language ⋮ On the expressive power of first-order boolean functions in PCF ⋮ Applications of infinitary lambda calculus ⋮ A semantics for nabla ⋮ Interaction Nets with McCarthy's amb ⋮ The sequentially realizable functionals ⋮ A relative PCF-definability result for strongly stable functions and some corollaries ⋮ Higher order unification via explicit substitutions ⋮ Descendants and origins in term rewriting. ⋮ Games and full abstraction for FPC. ⋮ Full abstraction for PCF ⋮ Prelogical relations ⋮ Definability and Full Abstraction ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
This page was built for publication:
