Sciweavers

254 search results - page 7 / 51
» Qualified Computations in Functional Logic Programming
Sort
View
AGP
2003
IEEE
14 years 1 months ago
Time Equations for Lazy Functional (Logic) Languages
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
Elvira Albert, Josep Silva, Germán Vidal
PPDP
2001
Springer
14 years 29 days ago
An Implementation of Narrowing Strategies
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
Sergio Antoy, Michael Hanus, Bart Massey, Frank St...
CORR
1998
Springer
126views Education» more  CORR 1998»
13 years 8 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
ICFP
2010
ACM
13 years 9 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
LICS
2005
IEEE
14 years 2 months ago
A Functional Quantum Programming Language
We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by ...
Thorsten Altenkirch, Jonathan Grattage