4850 search results - page 349 / 970 » Proof and Computation in Geometry |
232
click to vote
RTA
1993
Springer
15 years 11 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 ...
232
click to vote
TLCA
1993
Springer
15 years 11 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...
137
click to vote
BIRTHDAY
2006
Springer
15 years 10 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...
198
click to vote
CIE
2006
Springer
15 years 10 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...
169
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...