Infinite Computation, Co-induction and Computational Logic

DOI10.1007/978-3-642-22944-2_4zbMath1344.68053OpenAlexW1570366700MaRDI QIDQ3090859

Brian Devries, Feliks Kluźniak, Kyle Marple, Neda Saeedloei, Richard Min, Gopal Gupta

Publication date: 2 September 2011

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22944-2_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (7)

On dual programs in co-logic programming and the Horn \({\mu}\)-calculus ⋮ Extending Co-logic Programs for Branching-Time Model Checking ⋮ Coalgebraic Semantic Model for the Clock Constraint Specification Language ⋮ Fifty Years of Prolog and Beyond ⋮ Proof-theoretic foundations of normal logic programs ⋮ Flexible coinductive logic programming ⋮ On Dual Programs in Co-Logic Programming

Uses Software

• MMC

This page was built for publication: Infinite Computation, Co-induction and Computational Logic