Language Constructs for Non-Well-Founded Computation

DOI10.1007/978-3-642-37036-6_4zbMath1381.68034OpenAlexW2147602040MaRDI QIDQ5326277

Dexter Kozen, Jean-Baptiste Jeannin, Alexandra Silva

Publication date: 5 August 2013

Published in: Programming Languages and Systems (Search for Journal in Brave)

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

zbMATH Keywords

recursionfunctional programmingcoalgebraic types

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Unnamed Item ⋮ Well-founded coalgebras, revisited ⋮ Finiteness and rational sequences, constructively ⋮ Generalizing Inference Systems by Coaxioms ⋮ Friends with Benefits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions