Sciweavers

5499 search results - page 43 / 1100
» Generalized Rewrite Theories
Sort
View
ENTCS
2002
118views more  ENTCS 2002»
13 years 7 months ago
Rank 2 Types for Term Graph Rewriting
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
Steffen van Bakel
ICTAC
2004
Springer
14 years 1 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
ATAL
2006
Springer
13 years 11 months ago
Prototyping 3APL in the Maude term rewriting language
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...
M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Da...

Lecture Notes
2754views
15 years 6 months ago
Advanced Microeconomic Theory
These lecture notes cover several topics such as Preliminaries on Modern Economics and Mathematics, Consumer Theory, Production Theory, Choice Under Uncertainty, Game Theory, Theor...
Guoqiang Tian
FMCAD
2009
Springer
13 years 11 months ago
Generalized, efficient array decision procedures
Abstract--The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allow...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...