Sciweavers

137 search results - page 21 / 28
» Polymorphic Directional Types for Logic Programming
Sort
View
LISP
2008
105views more  LISP 2008»
13 years 7 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
IFIP
2010
Springer
13 years 2 months ago
Secrecy and Authenticity Types for Secure Distributed Messaging
Abstract. We introduce a calculus with mobile names, distributed principals and primitives for secure remote communication, without any reference to explicit cryptography. The calc...
Michele Bugliesi, Stefano Calzavara, Damiano Maced...
ILP
2005
Springer
14 years 1 months ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
PPDP
2009
Springer
14 years 2 days ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
ENTCS
2008
90views more  ENTCS 2008»
13 years 7 months ago
Quantum Data and Control Made Easier
In this paper we define nQML, a functional quantum programming language that follows the "quantum data and control" paradigm. In comparison to Altenkirch and Grattage�...
Michael Lampis, Kyriakos G. Ginis, Michalis A. Pap...