Results 1 - 10 of 2,294

Inductive-Data-Type Systems

by Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada , 2002
"... In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #-calA#Ik enriched by pattern-matching definitions folnitio a certain format,calat the "General Schem ..."
Abstract - Cited by 821 (23 self) - Add to MetaCart
In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #-calA#Ik enriched by pattern-matching definitions folnitio a certain format,calat the "

Theory and Practice of Constraint Handling Rules

by Thom Frühwirth , 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting of mu ..."
Abstract - Cited by 455 (37 self) - Add to MetaCart
of multi-headed guarded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will define syntax and semantics for CHR, introduce an important decidable

Towards a Standard Upper Ontology

by Ian Niles, Adam Pease , 2001
"... The Suggested Upper Merged Ontology (SUMO) is an upper level ontology that has been proposed as a starter document for The Standard Upper Ontology Working Group, an IEEE-sanctioned working group of collaborators from the fields of engineering, philosophy, and information science. The SUMO provides d ..."
Abstract - Cited by 589 (22 self) - Add to MetaCart
and the relations between them. Categories & Descriptors --- I.2.4 [Knowledge Representation Formalisms and Methods]: Artificial Intelligence -- representations (procedural and rule-based), semantic networks. General Terms --- Documentation, Languages, Standard-ization, Theory. Keywords --- Ontologies

Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I

by John Mccarthy , 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N00014-94-1-0775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science Depa ..."
Abstract - Cited by 457 (3 self) - Add to MetaCart
this formalism has advantages both as a programming language and as a vehicle for developing a theory of computation. Next, we describe S-expressions and S-functions, give some examples, and then describe the universal S-function apply which plays the theoretical role of a universal Turing machine

Universal coalgebra: a theory of systems

by J. J. M. M. Rutten , 2000
"... In the semantics of programming, nite data types such as finite lists, have traditionally been modelled by initial algebras. Later final coalgebras were used in order to deal with in finite data types. Coalgebras, which are the dual of algebras, turned out to be suited, moreover, as models for certa ..."
Abstract - Cited by 408 (42 self) - Add to MetaCart
, center for the study of Languages and information, Stanford, 1988) on a theory of non-wellfounded sets, in which he introduced a proof principle nowadays called coinduction. It was formulated in terms of bisimulation, a notion originally stemming from the world of concurrent programming languages. Using

Maude: Specification and Programming in Rewriting Logic

by M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, J. F. Quesada , 2001
"... Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and ..."
Abstract - Cited by 217 (65 self) - Add to MetaCart
Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules

PolySet Theory

by Roger Bishop Jones - http://www.rbjones.com/rbjpub/pp/doc/t020.pdf. p011.tex; 25/01/2010; 13:13; p.12 13
"... This document is concerned with the specification of an interpretation of the first order language of set theory. The purpose of this is to provide an ontological basis for foundation systems suitable for the formal derivation of mathematics. The ontology is to include the pure well-founded sets of ..."
Abstract - Cited by 259 (2 self) - Add to MetaCart
This document is concerned with the specification of an interpretation of the first order language of set theory. The purpose of this is to provide an ontological basis for foundation systems suitable for the formal derivation of mathematics. The ontology is to include the pure well-founded sets

Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ...

by Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted X , 1989
"... .We study properties of rewrite systems that are not necessarily terminating, but allow instead for trans#nite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of in#nitary theories ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
, see #23#. The theory of rewriting is an outgrowth of the study of the lambda calculus and combinatory logic, and # Preliminary versions #6, 7# of ideas in this paper were presented at the Sixteenth ACM Symposium on Principles of Programming Languages, Austin, TX #January 1989# and at the Sixteenth

The Rewriting Logic Semantics Project

by José Meseguer, Grigore Rosu - SOS 2005 , 2005
"... Rewriting logic is a flexible and expressive logical framework that unifies denota-tional semantics and SOS in a novel way, avoiding their respective limitations and allowing very succinct semantic definitions. The fact that a rewrite theory’s ax-ioms include both equations and rewrite rules provide ..."
Abstract - Cited by 62 (14 self) - Add to MetaCart
Rewriting logic is a flexible and expressive logical framework that unifies denota-tional semantics and SOS in a novel way, avoiding their respective limitations and allowing very succinct semantic definitions. The fact that a rewrite theory’s ax-ioms include both equations and rewrite rules

Definitional Trees

by Sergio Antoy - In Proc. of the 3rd International Conference on Algebraic and Logic Programming , 1992
"... . Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure representing, at a high level of abstraction, a form of control. Its application solves a specific problem arising in the design and implementation of inherently sequential, ..."
Abstract - Cited by 158 (40 self) - Add to MetaCart
, lazy, functional programming languages based on rewriting. For example, we show how to extend the expressive power of Log(F ) and how to improve the efficiency of an implementation of BABEL. Our framework provides a notion of degree of parallelism of an operation and shows that the elements of a
Results 1 - 10 of 2,294