Sciweavers

4835 search results - page 186 / 967
» Refactoring Functional Programs
Sort
View
71
Voted
COLT
1992
Springer
15 years 2 months ago
On Learning Limiting Programs
Machine learning of limit programs (i.e., programs allowed finitely many mind changes about their legitimate outputs) for computable functions is studied. Learning of iterated lim...
John Case, Sanjay Jain, Arun Sharma
70
Voted
ICLP
2010
Springer
15 years 2 months ago
HEX Programs with Action Atoms
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...
Selen Basol, Ozan Erdem, Michael Fink, Giovambatti...
132
Voted
AAIP
2009
14 years 11 months ago
Incremental Learning in Inductive Programming
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
Robert Henderson
JFP
2000
91views more  JFP 2000»
14 years 10 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
74
Voted
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
15 years 4 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman