Sciweavers

1000 search results - page 186 / 200
» Nominal rewriting systems
Sort
View
JFP
2008
109views more  JFP 2008»
13 years 8 months ago
An operational semantics for Scheme
This paper presents an operational semantics for the core of Scheme. Our specification improves over the denotational semantics from the Revised5 Report on Scheme specification in...
Jacob Matthews, Robert Bruce Findler
JUCS
2006
104views more  JUCS 2006»
13 years 8 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
JACM
2007
85views more  JACM 2007»
13 years 8 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
JSW
2007
133views more  JSW 2007»
13 years 8 months ago
New Functions for Unsupervised Asymmetrical Paraphrase Detection
Abstract— Monolingual text-to-text generation is an emerging research area in Natural Language Processing. One reason for the interest in such generation systems is the possibili...
João Cordeiro, Gaël Dias, Pavel Brazdi...
ENTCS
2000
114views more  ENTCS 2000»
13 years 8 months ago
Syntactic Type Soundness for the Region Calculus
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
Simon Helsen, Peter Thiemann