scientific article; zbMATH DE number 16188

zbMATH Open0735.68056MaRDI QIDQ3972839FDOQ3972839

Authors: Stavros S. Cosmandakis 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

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

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)

Cited In (10)

• Type inference with recursive types: Syntax and semantics
• An operational domain-theoretic treatment of recursive types
• Title not available (Why is that?)
• Confluence of the lambda calculus with left-linear algebraic rewriting
• A fixed-point semantics for feature type systems
• Title not available (Why is that?)
• Adequacy for a lazy functional language with recursive and polymorphic types
• The insensitivity theorem for nonreducing reflexive types
• Title not available (Why is that?)
• A universality theorem for PCF with recursive types, parallel-or and ∃

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)