Monotone recursive definition of predicates and its realizability interpretation

DOI10.1007/3-540-54415-1_40zbMath1493.68124OpenAlexW1486186677MaRDI QIDQ5096211

Makoto Tatsuta

Publication date: 16 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-54415-1_40

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Realizability interpretation of coinductive definitions and program synthesis with streams

Cites Work

• Unnamed Item
• Unnamed Item
• Program synthesis using realizability
• Realizability interpretation of generalized inductive definitions
• Inductively defined types in the Calculus of Constructions

This page was built for publication: Monotone recursive definition of predicates and its realizability interpretation