Sciweavers

RTA
2010
Springer
15 years 8 months ago
Simulation in the Call-by-Need Lambda-Calculus with letrec
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
Manfred Schmidt-Schauß, David Sabel, Elena M...
RTA
2010
Springer
15 years 8 months ago
Optimizing mkbTT
We describe performance enhancements that have been added to mkbTT, a modern completion tool combining multi-completion with the use of termination tools.
Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Mas...
RTA
2010
Springer
15 years 8 months ago
Proving Productivity in Infinite Data Structures
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...
Hans Zantema, Matthias Raffelsieper
RTA
2010
Springer
15 years 8 months ago
Order-Sorted Unification with Regular Expression Sorts
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
Temur Kutsia, Mircea Marin
RTA
2010
Springer
15 years 8 months ago
An Efficient Nominal Unification Algorithm
Jordi Levy, Mateu Villaret