Generalizing Inference Systems by Coaxioms
From MaRDI portal
Publication:2988632
DOI10.1007/978-3-662-54434-1_2zbMath1485.68053OpenAlexW2963913088MaRDI QIDQ2988632
Francesco Dagnino, Davide Ancona, Elena Zucca
Publication date: 19 May 2017
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54434-1_2
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (7)
Soundness Conditions for Big-Step Semantics ⋮ Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types ⋮ Enhancing expressivity of checked corecursive streams ⋮ Checked corecursive streams: expressivity and completeness ⋮ Unnamed Item ⋮ Flexible coinductive logic programming ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Flag-based big-step semantics
- Coinductive big-step operational semantics
- Fixed point theorems and semantics: A folk tale
- Co-induction in relational semantics
- A lattice-theoretical fixpoint theorem and its applications
- Tabling, Rational Terms, and Coinduction Finally Together!
- The power of parameterization in coinductive proof
- Trace-Based Coinductive Operational Semantics for While
- Iterative algebras at work
- Corecursive Algebras: A Study of General Structured Corecursion
- Abstract interpretation and application to logic programs
- CoCaml: Functional Programming with Regular Coinductive Types
- Language Constructs for Non-Well-Founded Computation
- Well-founded coalgebras, revisited
- Co-Logic Programming: Extending Logic Programming with Coinduction
- Coinductive Logic Programming
- Infinite objects in type theory
This page was built for publication: Generalizing Inference Systems by Coaxioms