SeveriDeVriesTLCA2013.pdf (345.02 kB)
Completeness of Conversion between Reactive Programs for Ultrametric Models
conference contribution
posted on 2013-06-11, 10:45 authored by Paula Severi, Fer-Jan de VriesIn 1970 Friedman proved completeness of beta eta conversion in the simply-typed lambda calculus for the set-theoretical model. Recently Krishnaswami and Benton have captured the essence of Hudak’s reactive programs in an extension of simply typed lambda calculus with causal streams and a temporal modality and provided this typed lambda calculus for reactive programs with a sound ultrametric semantics.
We show that beta eta conversion in the typed lambda calculus of reactive programs is complete for the ultrametric model.
History
Citation
Lecture Notes in Computer Science, 2013, 7941, pp. 221-235Author affiliation
/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer ScienceSource
11th International Conference on Typed Lambda Calculi and Applications (TLCA), EindhovenVersion
- AM (Accepted Manuscript)
Published in
Lecture Notes in Computer SciencePublisher
Springer Berlin Heidelbergissn
0302-9743eissn
1611-3349isbn
978-3-642-38945-0Copyright date
2013Available date
2014-06-28Publisher DOI
Publisher version
http://link.springer.com/chapter/10.1007/978-3-642-38946-7_17Temporal coverage: start date
2013-06-26Temporal coverage: end date
2013-06-28Language
enAdministrator link
Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC