Labelled reductions, runtime errors, and operational subsumption
From MaRDI portal
Publication:4572006
DOI10.1007/3-540-63165-8_231zbMath1401.68031OpenAlexW1607859075MaRDI QIDQ4572006
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theory of binding structures and applications to rewriting
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Type inference for record concatenation and multiple inheritance
- A modest model of records, inheritance, and bounded quantification
- A lambda-calculus for dynamic binding
- Inheritance as implicit coercion
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Full abstraction in the lazy lambda calculus
- Combinatory reduction systems: Introduction and survey
- Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus
- From operational semantics to domain theory
- Operations on records
- An ideal model for recursive polymorphic types
- FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES
- Data Types as Lattices
- Full Abstraction and the Context Lemma