SIGN IN
SIGN UP
A computational approach to reflective meta-reasoning about languages with bindings
Full Text:
Pdf
Buy this Article
Authors:
Aleksey Nogin
California Institute of Technology, Pasadena, CA
Alexei Kopylov
California Institute of Technology, Pasadena, CA
Xin Yu
California Institute of Technology, Pasadena, CA
Jason Hickey
California Institute of Technology, Pasadena, CA
2005 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 4
· Downloads (cumulative): 171
· Citation Count: 7
Published in:
· Proceeding
MERLIN '05
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Pages 2 - 12
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-59593-072-8
doi>
10.1145/1088454.1088456
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
ICFP'13
Share:
|
Tags:
experimentation
formal languages
higher-order abstract syntax
languages
languages with bindings
metaprl
nuprl
programming language
reflection
syntax
theory
type theory
verification
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