Labelled reductions, runtime errors, and operational subsumption

DOI10.1007/3-540-63165-8_231MaRDI QIDQ4572006zbMATH OpenOpenAlexFDO

Authors Laurent Dami

Publication date 4 July 2018

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://archive-ouverte.unige.ch/unige:155308

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites work

• A lambda-calculus for dynamic binding
• A modest model of records, inheritance, and bounded quantification
• A theory of binding structures and applications to rewriting
• An ideal model for recursive polymorphic types
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus
• Combinatory reduction systems: Introduction and survey
• Data Types as Lattices
• FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES
• From operational semantics to domain theory
• Full Abstraction and the Context Lemma
• Full abstraction in the lazy lambda calculus
• scientific article; zbMATH DE number 4180818 (Why is no real title available?)
• scientific article; zbMATH DE number 1231606 (Why is no real title available?)
• scientific article; zbMATH DE number 615137 (Why is no real title available?)
• Inheritance as implicit coercion
• Operations on records
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Type inference for record concatenation and multiple inheritance

This page was built for publication: Labelled reductions, runtime errors, and operational subsumption

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