Sciweavers

WFLP
2009
Springer
255views Algorithms» more  WFLP 2009»
14 years 3 months ago
Constraint Based Strategies
Numerous computational and deductive frameworks use the notion of strategy to guide reduction and search space exploration, making the macro scale control of micro operations an ex...
Claude Kirchner, Florent Kirchner, Hél&egra...
WFLP
2009
Springer
255views Algorithms» more  WFLP 2009»
14 years 5 months ago
A Simple Region Inference Algorithm for a First-Order Functional Language
Manuel Montenegro, Ricardo Peña-Marí...
WFLP
2009
Springer
297views Algorithms» more  WFLP 2009»
14 years 5 months ago
Programming with Multiple Paradigms in Lua
Abstract. Lua is a scripting language used in many industrial applications, with an emphasis on embedded systems and games. Two key points in the design of the language that led to...
Roberto Ierusalimschy
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 5 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 5 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
WFLP
2009
Springer
244views Algorithms» more  WFLP 2009»
14 years 5 months ago
Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types
This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reduci...
Yuki Kato, Koji Nakazawa