198 search results - page 4 / 40 » A New Approach to Abstract Syntax Involving Binders |
137
Voted
SFP
2001
15 years 5 months ago
2001
We describe the design and implementation of a Standard ML of New Jersey library for the interactive pretty-printing of possibly infinite syntax trees. The library handles elision ...
172
click to vote
PKDD
2004
Springer
15 years 9 months ago
2004
Springer
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
113
Voted
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
135
click to vote
ESOP
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
138
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some i...