1999 search results - page 100 / 400 » Dependently Typed Grammars |
174
click to vote
FORTEST
2008
15 years 7 months ago
2008
Algebraic specifications of data types provide a natural basis for testing data types implementations. In this framework, the conformance relation is based on the satisfaction of a...
165
click to vote
TCS
2008
15 years 6 months ago
2008
We describe a type system for the Xd calculus of Gardner and Maffeis. An Xd-network is a network of locations, where each location consists of both a data tree (which contains scr...
162
click to vote
ICFP
2001
ACM
16 years 6 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
190
click to vote
CSL
2005
Springer
15 years 11 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
141
click to vote
TYPES
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...