Soundness Conditions for Big-Step Semantics
From MaRDI portal
Publication:5041092
DOI10.1007/978-3-030-44914-8_7OpenAlexW3021347643MaRDI QIDQ5041092
Elena Zucca, Francesco Dagnino, Mariangiola Dezani-Ciancaglini, Viviana Bono
Publication date: 13 October 2022
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.08738
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Flag-based big-step semantics
- Coinductive big-step operational semantics
- A theory of type polymorphism in programming
- Definitional interpreters for higher-order programming languages
- A syntactic approach to type soundness
- Testing equivalences for processes
- Universal coalgebra: A theory of systems
- A structural approach to operational semantics
- Intersection and union types: Syntax and semantics
- Generalizing Inference Systems by Coaxioms
- Big-step Operational Semantics Revisited
- Sequent calculi for induction and infinite descent
- The Essence of Dependent Object Types
- Abstract interpretation and application to logic programs
- A Filter Model for Concurrent $\lambda$-Calculus
- Operational semantics using the partiality monad
- General Recursion via Coinductive Types
- Pretty-Big-Step Semantics
- A virtual class calculus
- Type soundness proofs with definitional interpreters
- From Natural Semantics to Abstract Machines
- Automated Reasoning with Analytic Tableaux and Related Methods
This page was built for publication: Soundness Conditions for Big-Step Semantics