7 search results - page 1 / 2 » A Fresh Approach to Representing Syntax with Static Binders ... |
ICFP
2001
ACM
14 years 4 months ago
2001
ACM
ICFP
2003
ACM
14 years 4 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
ICFP
2012
ACM
11 years 7 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...