Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394567zbMATH OpenOpenAlexFDO

Authors Ulrich Berger

Publication date 1 November 2006

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

Full work available at URL https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• New Computational Paradigms
• Continuous semantics for strong normalisation
• Strong normalisation for applied lambda calculi
• scientific article; zbMATH DE number 512779
• Strong normalization of barrecursive terms without using infinite terms

Cited in

(15)

• Strong normalization theorem for a constructive arithmetic with definition by transfinite recursion and bar induction
• Some characteristics of strong innermost normalization
• A version of the Lohwater-Pommerenke theorem for strongly normal functions
• On strong normality
• Continuous semantics for strong normalisation
• Strong normalization of barrecursive terms without using infinite terms
• scientific article; zbMATH DE number 4055611 (Why is no real title available?)
• scientific article; zbMATH DE number 512779 (Why is no real title available?)
• A normalization theorem for set theory
• Strong normalisation for applied lambda calculi
• A proof of strong normalisation using domain theory
• New Computational Paradigms
• Foundations of Software Science and Computation Structures
• On the Logical Strength of Confluence and Normalisation for Cyclic Proofs.
• Uniform strong normalization for multi-discipline calculi

This page was built for publication: Computer Science Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394567)