Assertions and recursions

DOI10.1007/3-540-61254-8_25zbMath1434.03085OpenAlexW1504224784MaRDI QIDQ4645810

Bernhard Möller

Publication date: 11 January 2019

Published in: Higher-Order Algebra, Logic, and Term Rewriting (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/files/23507/M%C3%B6ller1996.pdf

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Other algebras related to logic (03G25) Applications of computability and recursion theory (03D80)

Cites Work

• Sequential calculus
• Fixed-point calculus
• The Munich project CIP. Volume I: The wide spectrum language CIP-L
• Shorter paths to graph algorithms
• Reductivity
• Formal program construction by transformations-computer-aided, intuition-guided programming
• Data Types as Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Assertions and recursions