265 search results - page 10 / 53 » How to Prove Inductive Theorems |
CADE
1998
Springer
13 years 12 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Bundy and Richardson [7] presented a technique for reasoning about lists using ellipsis (the dots in 1+2+...+10), where a polymorphic function, denoted by 2, is used to encapsulate...
ENTCS
2002
13 years 7 months ago
2002
We investigate the reasons for which the existence of certain right adjoints implies the existence of some final coalgebras, and vice-versa. In particular we prove and discuss the...
ESOP
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
LICS
2012
IEEE
11 years 10 months ago
2012
IEEE
—We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the s...