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...
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...
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...
These lecture notes cover several topics such as Preliminaries on Modern Economics and Mathematics, Consumer Theory, Production Theory, Choice Under Uncertainty, Game Theory, Theor...
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...