Continuous semantics for strong normalisation

DOI10.1017/S0960129506005457zbMATH Open1115.03008OpenAlexW2170835260MaRDI QIDQ3422018FDOQ3422018

Authors: Ulrich Berger 

Publication date: 9 February 2007

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129506005457

Recommendations

• New Computational Paradigms
• Computer Science Logic
• Strong normalisation for applied lambda calculi
• A domain model characterising strong normalisation
• A proof of strong normalisation using domain theory

zbMATH Keywords

lambda calculusbar recursiondomain-theoretic semanticshigher-type rewrite systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55)

Cited In (7)

• On completeness of reducibility candidates as a semantics of strong normalization
• Title not available (Why is that?)
• Title not available (Why is that?)
• A proof of strong normalisation using domain theory
• Computer Science Logic
• New Computational Paradigms
• Breaking through the normalization barrier: a self-interpreter for F-omega

This page was built for publication: Continuous semantics for strong normalisation

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