Lazy Theories of Operations and Types

DOI10.1093/LOGCOM/3.1.77MaRDI QIDQ4272506zbMATH OpenOpenAlexFDO

Authors Raymond Turner

Publication date 6 December 1993

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/3.1.77

zbMATH Keywords

constructive set theoryfunctional programmingoperationsproofs and programsterminationtypes

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Inner models, including constructibility, ordinal definability, and core models (03E45) Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Weak Theories of Operations and Types
• scientific article; zbMATH DE number 3850461
• scientific article; zbMATH DE number 3881865
• Type theory as a foundation for computer science
• Lazy lambda calculus: theories, models and local structure characterization (extended abstract)

Cited in

(4)

• An operational semantics of sharing in lazy evaluation
• Weak Theories of Operations and Types
• Realist consequence, epistemic inference, computational correctness
• Lazy behavioral subtyping

This page was built for publication: Lazy Theories of Operations and Types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4272506)