Strong stability and the incompleteness of stable models for \(\lambda\)-calculus

DOI10.1016/S0168-0072(99)00015-9zbMath0935.03021MaRDI QIDQ1125063

Xavier Gouy, Olivier Bastonero

Publication date: 29 November 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

strong stabilityincompletenessdenotational semanticslambda calculuscontinuous modelstable models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (4)

Easiness in graph models ⋮ Graph lambda theories ⋮ Towards Lambda Calculus Order-Incompleteness ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models

This page was built for publication: Strong stability and the incompleteness of stable models for \(\lambda\)-calculus