scientific article; zbMATH DE number 16188

MaRDI QIDQ3972839zbMATH OpenFDO

Authors Stavros S. Cosmandakis

Publication date 26 June 1992

zbMATH Keywords

full abstractiondomain theorylambda calculusrecursive typeslazy evaluationcomputational adequacy

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55)

Recommendations

• Full abstraction in the lazy lambda calculus
• scientific article; zbMATH DE number 3938562
• scientific article; zbMATH DE number 512785
• Lambda-calculi for (strict) parallel functions
• Adequacy for a lazy functional language with recursive and polymorphic types

Cited in

(10)

• Type inference with recursive types: Syntax and semantics
• An operational domain-theoretic treatment of recursive types
• scientific article; zbMATH DE number 5033764 (Why is no real title available?)
• A universality theorem for PCF with recursive types, parallel-or and ∃
• scientific article; zbMATH DE number 445161 (Why is no real title available?)
• The insensitivity theorem for nonreducing reflexive types
• Confluence of the lambda calculus with left-linear algebraic rewriting
• Adequacy for a lazy functional language with recursive and polymorphic types
• A fixed-point semantics for feature type systems
• scientific article; zbMATH DE number 3887103 (Why is no real title available?)

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