41 search results - page 5 / 9 » Induction, Coinduction, and Adjoints |
63
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. H...
124
click to vote
TLCA
1993
Springer
15 years 1 months ago
1993
Springer
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
ENTCS
2010
14 years 9 months ago
2010
It is not clear what a system for evidence-based common knowledge should look like if common knowledge is treated as a greatest fixed point. This paper is a preliminary step towar...
ESOP
2010
Springer
15 years 6 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
84
Voted
CIE
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...