scientific article
From MaRDI portal
Publication:3121528
zbMath1432.68251arXiv1808.02943MaRDI QIDQ3121528
Publication date: 18 March 2019
Full work available at URL: https://arxiv.org/abs/1808.02943
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Complete lattices, completions (06B23) Semantics in the theory of computing (68Q55) Mechanization of proofs and logical operations (03B35) Structure of proofs (03F07)
Related Items (5)
Soundness Conditions for Big-Step Semantics ⋮ Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types ⋮ Classical (co)recursion: Mechanics ⋮ Unnamed Item ⋮ Flexible coinductive logic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-well-founded trees in categories
- Coinductive big-step operational semantics
- Fundamental properties of infinite trees
- Fixed point theorems and semantics: A folk tale
- Co-induction in relational semantics
- Infinite trees and completely iterative theories: A coalgebraic view
- Wellfounded trees in categories
- Universal coalgebra: A theory of systems
- A lattice-theoretical fixpoint theorem and its applications
- Tabling, Rational Terms, and Coinduction Finally Together!
- Copatterns
- The power of parameterization in coinductive proof
- Generalizing Inference Systems by Coaxioms
- Sequent calculi for induction and infinite descent
- Introduction to Bisimulation and Coinduction
- Trace-Based Coinductive Operational Semantics for While
- A Theoretical Perspective of Coinductive Logic Programming
- Iterative algebras at work
- Complete Lattices and Up-To Techniques
- Abstract interpretation and application to logic programs
- CoCaml: Functional Programming with Regular Coinductive Types
- A Coalgebraic View of Infinite Trees and Iteration
- Wellfounded recursion with copatterns
- Language Constructs for Non-Well-Founded Computation
- Co-Logic Programming: Extending Logic Programming with Coinduction
- Coinductive Logic Programming
- Automated Reasoning with Analytic Tableaux and Related Methods
- Types for Proofs and Programs
This page was built for publication:
