Sciweavers

850 search results - page 49 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
AGP
2003
IEEE
15 years 6 months ago
An Ordered Choice Logic Programming Front-End for Answer Set Solvers
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives without the burden of any form of negation. This complete ab...
Marina De Vos
ENTCS
2006
156views more  ENTCS 2006»
15 years 1 months ago
Computational Effects in Topological Domain Theory
This paper contributes towards establishing the category QCB, of topological quotients of countably based spaces, and its subcategory TP, of topological predomains, as a flexible ...
Ingo Battenfeld
APLAS
2004
ACM
15 years 6 months ago
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
Koichi Kodama, Kohei Suenaga, Naoki Kobayashi
ICFP
2010
ACM
15 years 2 months ago
Logical types for untyped languages
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
Sam Tobin-Hochstadt, Matthias Felleisen
AIIA
1995
Springer
15 years 4 months ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung