Sciweavers

1686 search results - page 63 / 338
» Higher Order Deforestation
Sort
View
RTA
2000
Springer
15 years 3 months ago
Linear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
Philippe de Groote
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
15 years 3 months ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones
TYPES
2000
Springer
15 years 3 months ago
Executing Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
Stefan Berghofer, Tobias Nipkow
DBPL
1995
Springer
124views Database» more  DBPL 1995»
15 years 3 months ago
Scaling Database Languages to Higher-Order Distributed Programming
We describe the Tycoon   approach to scale the successful notion of a uniform, type-safe persistent object store to communication-intensive applications and applications where lo...
Bernd Mathiske, Florian Matthes, Joachim W. Schmid...