Sciweavers

811 search results - page 10 / 163
» Refactoring Using Type Constraints
Sort
View
POPL
1998
ACM
14 years 24 days ago
Local Type Inference
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
Benjamin C. Pierce, David N. Turner
PLANX
2007
13 years 10 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
ESOP
1994
Springer
14 years 20 days ago
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Torben Amtoft
NAACL
2007
13 years 10 months ago
Relationship between Non-Projective Edges, Their Level Types, and Well-Nestedness
Dependency analysis of natural language gives rise to non-projective structures. The constraint of well-nestedness on dependency trees has been recently shown to give a good fit ...
Jirí Havelka
BIOCOMP
2008
13 years 10 months ago
Combinations of Context-Free Shifts and Shifts of Finite Type
A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequences. In terms of the theory of symbolic dynamics, neither of the Dyck shift nor the Motzki...
Hiroshi Kamabe