3228 search results - page 273 / 646 » Computationally Sound Proofs |
135
click to vote
CSR
2010
Springer
15 years 9 months ago
2010
Springer
By terms-allowed-in-types capacity, the Logic of Proofs LP includes formulas of the form t : Ï•(t), which have self-referential meanings. In this paper, “prehistoric phenomenaâ€...
185
Voted
RTA
1993
Springer
15 years 8 months ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
187
Voted
TLCA
1993
Springer
15 years 8 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...
111
click to vote
BIRTHDAY
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We propose to use Grothendieck institutions based on 2categorical diagrams as a basis for heterogeneous specification. We prove a number of results about colimits and (so...
138
Voted
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. Designing datatype-generic programs brings new challenges and new opportunities. We review th...