SIGN IN
SIGN UP
A meta-programming approach to realizing dependently typed logic programming
Full Text:
Pdf
Buy this Article
Authors:
Zachary Snow
University of Minnesota, Minneapolis, MN, USA
David Baelde
University of Minnesota, Minneapolis, MN, USA
Gopalan Nadathur
University of Minnesota, Minneapolis, MN, USA
Published in:
· Proceeding
PPDP '10
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Pages 187-198
ACM
New York, NY
, USA
©2010
table of contents
ISBN: 978-1-4503-0132-9
doi>
10.1145/1836089.1836113
2010 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 8
· Downloads (cumulative): 39
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
dependently typed lambda calculi
higher-order logic programming
lambda calculus and related systems
languages
logic and constraint programming
logical frameworks
proof theory
theory
translation
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