Sciweavers

MST
2007
168views more  MST 2007»
13 years 3 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
CIE
2005
Springer
13 years 9 months ago
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Milad Niqui
LICS
2006
IEEE
13 years 9 months ago
Avoiding Determinization
Automata on infinite objects are extensively used in system specification, verification, and synthesis. While some applications of the automata-theoretic approach have been wel...
Orna Kupferman
CSL
2007
Springer
13 years 9 months ago
Tightening the Exchange Rates Between Automata
Automata on infinite objects were the key to the solution of several fundamental decision problems in mathematics and logic. Today, automata on infinite objects are used for form...
Orna Kupferman