Sciweavers

2 search results - page 1 / 1
» Strictness, totality, and non-standard-type inference
Sort
View
TCS
2002
13 years 7 months ago
Strictness, totality, and non-standard-type inference
In this paper we present two non-standard-type inference systems for conjunctive strictness and totality analyses of higher-order-typed functional programs and prove completeness ...
Mario Coppo, Ferruccio Damiani, Paola Giannini
PLANX
2008
13 years 9 months ago
XML Type Checking for Macro Tree Transducers with Holes
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...
Sebastian Maneth, Keisuke Nakano