313 search results - page 40 / 63 » Formalizing the Halting Problem in a Constructive Type Theor... |
TLCA
2005
Springer
14 years 1 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
FOAL
2009
ACM
14 years 2 months ago
2009
ACM
Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of fe...
GG
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....