Sciweavers

20 search results - page 1 / 4
» Type Introduction for Equational Rewriting
Sort
View
58
Voted
LFCS
1997
Springer
15 years 3 months ago
Type Introduction for Equational Rewriting
Hitoshi Ohsaki, Aart Middeldorp
BIRTHDAY
2004
Springer
15 years 4 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
TLCA
2007
Springer
15 years 5 months ago
Extensional Rewriting with Sums
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with...
Sam Lindley
JACM
2007
85views more  JACM 2007»
14 years 11 months ago
The rational numbers as an abstract data type
onal Numbers as an Abstract Data Type1 J A Bergstra2 University of Amsterdam, Informatics Institute, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands J V Tucker3 Department of Com...
Jan A. Bergstra, J. V. Tucker
CSL
2005
Springer
15 years 4 months ago
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
Frédéric Blanqui