1071 search results - page 9 / 215 » Programming with enumerable sets of structures |
IJCAI
1989
13 years 8 months ago
1989
1 describe an approach to the problem of forming hypotheses about hidden mechanisms w; thin devices — the "black box" problem for physical systems. The approach involv...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
ITA
2007
13 years 7 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
ASP
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
DM
2011
12 years 11 months ago
2011
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...