scientific article; zbMATH DE number 794258

MaRDI QIDQ4847018zbMATH OpenFDO

Authors Pietro Di Gianantonio, Furio Honsell, Gordon D. Plotkin

Publication date 25 June 1996

zbMATH Keywords

denotational semanticslambda-calculus

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Recommendations

• On the completeness of order-theoretic models of the \(\lambda \)-calculus
• From term models to domains
• Effective λ-models versus recursively enumerable λ-theories
• Lambda Theories of Effective Lambda Models
• Lambda-calculi for (strict) parallel functions

Cited in

(13)

• On the completeness of order-theoretic models of the \(\lambda \)-calculus
• Every countable poset is embeddable in the poset of unsolvable terms
• A representable approach to finite nondeterminism
• Generalized filter models
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications
• Dedekind completion as a method for constructing new Scott domains
• On Proving Limiting Completeness
• scientific article; zbMATH DE number 759438 (Why is no real title available?)
• A -denotational semantics for map theory in ZFC+SI
• Verified exact real computation with nondeterministic functions and limits
• Two guarded recursive powerdomains for applicative simulation
• Uniqueness of Scott's reflexive domain in \(P\omega \)

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 Q4847018)