2646 search results - page 47 / 530 » Local Type Inference |
130
click to vote
PLANX
2008
15 years 1 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...
120
click to vote
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
59
Voted
ICFP
2006
ACM
16 years 14 days 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...
123
Voted
ICFP
2005
ACM
16 years 14 days 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...
105
Voted
ICDT
2007
ACM
15 years 6 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....