SIGN IN
SIGN UP
Semantic analysis of normalisation by evaluation for typed lambda calculus
Full Text:
Pdf
Buy this Article
Author:
Marcelo Fiore
University of Cambridge
Published in:
· Proceeding
PPDP '02
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Pages 26 - 37
ACM
New York, NY
, USA
©2002
table of contents
ISBN:1-58113-528-9
doi>
10.1145/571157.571161
2002 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 47
· Downloads (cumulative): 309
· Citation Count: 26
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algebraic approaches to semantics
categorical glueing
denotational semantics
formal definitions and theory
initial algebra semantics
lambda definability
languages
logical relations
normalisation by evaluation
partial evaluation
theory
typed abstract syntax with variable binding
typed lambda calculus
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder