Sciweavers

499 search results - page 58 / 100
» Constructive Induction by Analogy
Sort
View
ICFP
2010
ACM
13 years 8 months ago
Total parser combinators
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
Nils Anders Danielsson
JFP
2006
113views more  JFP 2006»
13 years 7 months ago
Consistency of the theory of contexts
The Theory of Contexts is a type-theoretic axiomatization aiming to give a metalogical account of the fundamental notions of variable and context as they appear in Higher stract S...
Anna Bucalo, Furio Honsell, Marino Miculan, Ivan S...
ENTCS
2007
112views more  ENTCS 2007»
13 years 7 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
CIE
2007
Springer
14 years 1 months ago
Characterizing Programming Systems Allowing Program Self-reference
The interest is in characterizing insightfully the power of program self-reference in effective programming systems (epses), the computability-theoretic analogs of programming lan...
John Case, Samuel E. Moelius
ATAL
2007
Springer
13 years 11 months ago
On discovery and learning of models with predictive representations of state for agents with continuous actions and observations
Models of agent-environment interaction that use predictive state representations (PSRs) have mainly focused on the case of discrete observations and actions. The theory of discre...
David Wingate, Satinder P. Singh