Results 1  10
of
1,990
ELAN from a rewriting logic point of view
 Theoretical Computer Science
, 2002
"... ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as nondeterministic rule based processes. With the general goal to make pr ..."
Abstract

Cited by 59 (4 self)
 Add to MetaCart
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as nondeterministic rule based processes. With the general goal to make
An Overview of ELAN
, 1998
"... This paper presents a comprehensive introduction to the ELAN rulebased programming language. We describe the main features of the language, the ELAN environment, and introduce bibliographic references to various papers addressing foundations, implementation and applications of ELAN. 1 Introduction ..."
Abstract

Cited by 127 (24 self)
 Add to MetaCart
modular framework for studying their combination. ELAN takes from functional programming the concept of abstract data types and the function evaluation principle based on rewriting. But rewriting is inherently nondeterministic since several rules can be applied at different positions in a same term
Rewriting With Strategies In ELAN: A Functional Semantics
, 1999
"... In this work, we consider term rewriting from a functional point of view. A rewrite rule is a function that can be applied to a term using an explicit application function. From this starting point, we show how to build more elaborated functions, describing first rewrite derivations, then sets of d ..."
Abstract

Cited by 55 (10 self)
 Add to MetaCart
In this work, we consider term rewriting from a functional point of view. A rewrite rule is a function that can be applied to a term using an explicit application function. From this starting point, we show how to build more elaborated functions, describing first rewrite derivations, then sets
The rewriting calculus as a semantics of ELAN
 4th Asian Computing Science Conference, volume 1538 of LNCS
, 1998
"... Rewriting techniques are now recognized as a fundamental concept in many areas of computer science including mechanized theorem proving and operational semantics of programming languages. From a conceptual as well as operational point of view, the notion of rewrite rule application is crucial. It le ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Rewriting techniques are now recognized as a fundamental concept in many areas of computer science including mechanized theorem proving and operational semantics of programming languages. From a conceptual as well as operational point of view, the notion of rewrite rule application is crucial
Computational Interpretations of Linear Logic
 Theoretical Computer Science
, 1993
"... We study Girard's Linear Logic from the point of view of giving a concrete computational interpretation of the logic, based on the CurryHoward isomorphism. In the case of Intuitionistic Linear Logic, this leads to a refinement of the lambda calculus, giving finer control over order of evaluati ..."
Abstract

Cited by 318 (3 self)
 Add to MetaCart
We study Girard's Linear Logic from the point of view of giving a concrete computational interpretation of the logic, based on the CurryHoward isomorphism. In the case of Intuitionistic Linear Logic, this leads to a refinement of the lambda calculus, giving finer control over order
Descriptive Complexity
, 1999
"... book is dedicated to Daniel and Ellie. Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The book is designed for graduate students or advanced undergraduates in computer science or mathematics and is suitable as a textbook o ..."
Abstract

Cited by 329 (17 self)
 Add to MetaCart
book is dedicated to Daniel and Ellie. Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The book is designed for graduate students or advanced undergraduates in computer science or mathematics and is suitable as a textbook
On the Length of Programs for Computing Finite Binary Sequences
 Journal of the ACM
, 1966
"... The use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of instructions in programs. A modified form of Turing machine is studied from the same ..."
Abstract

Cited by 295 (8 self)
 Add to MetaCart
The use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of instructions in programs. A modified form of Turing machine is studied from
ELAN for Equational Reasoning in Coq
, 2000
"... We describe an interface between Coq, an interactive theoremprover based on type theory and ELAN, an automated deduction system based on rewriting logic. Our objective is to provide efficient tools to implement decision procedures using equational reasoning in Coq. ELAN is used as a rewrite engine. ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
We describe an interface between Coq, an interactive theoremprover based on type theory and ELAN, an automated deduction system based on rewriting logic. Our objective is to provide efficient tools to implement decision procedures using equational reasoning in Coq. ELAN is used as a rewrite engine
Multilanguage Hierarchical Logics (or: How We Can Do Without Modal Logics)
, 1994
"... MultiLanguage systems (ML systems) are formal systems allowing the use of multiple distinct logical languages. In this paper we introduce a class of ML systems which use a hierarchy of first order languages, each language containing names for the language below, and propose them as an alternative to ..."
Abstract

Cited by 212 (52 self)
 Add to MetaCart
to modal logics. The motivations of our proposal are technical, epistemological and implementational. From a technical point of view, we prove, among other things, that the set of theorems of the most common modal logics can be embedded (under the obvious bijective mapping between a modal and a first order
Confluence of Conditional Rewrite Systems
"... Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming. An important issue, in either case, is determining whether a rewrite system has the ChurchRosser, or confluence, prope ..."
Abstract

Cited by 57 (4 self)
 Add to MetaCart
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming. An important issue, in either case, is determining whether a rewrite system has the ChurchRosser, or confluence
Results 1  10
of
1,990