Sciweavers

4716 search results - page 432 / 944
» Tangible functional programming
Sort
View
225
Voted
FPCA
1995
15 years 10 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
ALT
2003
Springer
16 years 3 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
AGTIVE
2007
Springer
16 years 1 months ago
A Single-Step Term-Graph Reduction System for Proof Assistants
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...
Maarten de Mol, Marko C. J. D. van Eekelen, Rinus ...
116
Voted
ASPDAC
1998
ACM
81views Hardware» more  ASPDAC 1998»
15 years 11 months ago
A Heuristic Algorithm to Design AND-OR-EXOR Three-Level Networks
—An AND-OR-EXOR network, where the output EXOR gate has only two inputs, is one of the simplest three-level architecture. This network realizes an EXOR of two sum-of-products exp...
Debatosh Debnath, Tsutomu Sasao
153
Voted
UIST
1994
ACM
15 years 11 months ago
Evolutionary Learning of Graph Layout Constraints from Examples
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...
Toshiyuki Masui