1888 search results - page 68 / 378 » Proof theory and computational analysis |
COLING
1996
15 years 1 months ago
1996
This paper establishes a framework under which various aspects of prosodic morphology, such as templatic morphology and infixation, can be handled under two-level theory using an ...
94
Voted
CORR
2008
Springer
15 years 16 days ago
2008
Springer
We provide a computer verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the...
90
Voted
JAT
2010
14 years 7 months ago
2010
We study the efficient numerical solution of infinite matrix equations Au = f for a matrix A in the Jaffard algebra. These matrices appear naturally via frame discretizations in m...
207
click to vote
POPL
2007
ACM
16 years 23 days ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
122
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...