1081 search results - page 34 / 217 » Type Inference of SELF |
136
Voted
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
227
click to vote
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
In this paper we propose a type-based framework for using logic programming for XML processing. We transform XML documents into terms and DTDs into regular types. We implemented a ...
165
Voted
PLANX
2008
15 years 5 months ago
2008
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
86
Voted
ICFP
2006
ACM
16 years 3 months ago
2006
ACM
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...
149
Voted
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...