Sciweavers

1989 search results - page 120 / 398
» Set functions for functional logic programming
Sort
View
AAAI
2004
14 years 11 months ago
Negotiation as Mutual Belief Revision
This paper presents a logical framework for negotiation based on belief revision theory. We consider that a negotiation process is a course or multiple courses of mutual belief re...
Dongmo Zhang, Norman Y. Foo, Thomas Andreas Meyer,...
PADL
2001
Springer
15 years 2 months ago
An A-Prolog Decision Support System for the Space Shuttle
The goal of this paper is to test if a programming methodology based on the declarative language A-Prolog and the systems for computing answer sets of such programs, can be succes...
Monica Nogueira, Marcello Balduccini, Michael Gelf...
LICS
1994
IEEE
15 years 1 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
TLCA
2005
Springer
15 years 3 months ago
A Lambda Calculus for Quantum Computation with Classical Control
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
Peter Selinger, Benoît Valiron
CORR
2006
Springer
123views Education» more  CORR 2006»
14 years 9 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini