On the characterization of models of H^*

DOI10.1145/2603088.2603111MaRDI QIDQ4635607zbMATH OpenOpenAlexWikidataFDO

Authors Flavien Breuvart

Publication date 23 April 2018

Published in Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2603088.2603111

zbMATH Keywords

full abstractiondomainsfilter models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• On the characterization of models of H^: the semantical aspect
• Relational graph models at work
• Full abstraction in the lazy lambda calculus
• Models of the lambda calculus: an introduction
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models

Cited in

(8)

• A semantic characterization of the well-typed formulae of \(\lambda\)- calculus
• Genericity through stratification
• Relational graph models, Taylor expansion and extensionality
• Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
• On the characterization of models of H^: the semantical aspect
• Relational graph models at work
• Behavioural inverse limit -models
• scientific article; zbMATH DE number 7204439 (Why is no real title available?)

This page was built for publication: On the characterization of models of \(\mathcal{H}^*\)

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