376 search results - page 8 / 76 » Developing Theories of Types and Computability via Realizabi... |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
ICMS
2010
13 years 5 months ago
2010
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups...
ICGA
2006
15 years 7 months ago
2006
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
—Accurate analog models of power system components are required in order to realize an analog computation engine for power systems. Analog computation is an area of continued int...