Results 1 - 10 of 178

A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi

by F. L. C. De Moura, A. V. Barbosa, M. Ayala-rincón, F. Kamareddine , 2010
"... SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to understand and explain properties of these calculi and to compare the different styles of making explicit the substitutio ..."
Abstract - Add to MetaCart
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to understand and explain properties of these calculi and to compare the different styles of making explicit

SUBSEXPL: A Framework for Simulating and Comparing Explicit Substitutions Calculi A Tutorial

by Flávio L. C. Moura, Mauricio Ayala-rincón, Fairouz Kamareddine , 2005
"... In this paper we present a framework, called SUBSEXPL, for simulating and comparing explicit substitutions calculi. This framework was developed in Ocaml, a language of the ML family, and it allows the manipulation of expressions of the λ-calculus and of several styles of explicit substitutions calc ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
In this paper we present a framework, called SUBSEXPL, for simulating and comparing explicit substitutions calculi. This framework was developed in Ocaml, a language of the ML family, and it allows the manipulation of expressions of the λ-calculus and of several styles of explicit substitutions

The theory of calculi with explicit substitutions revisited

by Delia Kesner - CSL 2007 , 2007
"... Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good computational behaviour of the original systems (with meta-level substitutions) they were implementing. In this paper we fi ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
first survey previous work in the domain by pointing out the motivations and challenges that guided the development of such calculi. Then we use very simple technology to establish a general theory of explicit substitutions for the lambda-calculus which enjoys fundamental properties such as simulation

SUBSEXPL: a Tool for Simulating and Comparing Explicit Substitutions Calculi

by Flávio L C De Moura , Mauricio Ayala-Rincón , Fairouz Kamareddine - Proc. 6th IEEE Symp , 2006
"... Abstract In this tutorial we present the system SUBSEXPL that is used for simulating and comparing explicit substitutions calculi. This framework was developed in Ocaml, a language of the ML family, and it allows the manipulation of expressions of the λ-calculus and of several styles of explicit su ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract In this tutorial we present the system SUBSEXPL that is used for simulating and comparing explicit substitutions calculi. This framework was developed in Ocaml, a language of the ML family, and it allows the manipulation of expressions of the λ-calculus and of several styles of explicit

Confluence Properties of Extensional and Non-Extensional lambda-Calculi with Explicit Substitutions (Extended Abstract)

by Delia Kesner - in Proceedings of the Seventh International Conference on Rewriting Techniques and Applications , 1996
"... ) Delia Kesner CNRS and LRI, B at 490, Universit e Paris-Sud - 91405 Orsay Cedex, France. e-mail:Delia.Kesner@lri.fr Abstract. This paper studies confluence properties of extensional and non-extensional #-calculi with explicit substitutions, where extensionality is interpreted by #-expansion. For ..."
Abstract - Cited by 27 (5 self) - Add to MetaCart
. For that, we propose a general scheme for explicit substitutions which describes those abstract properties that are sufficient to guarantee confluence. Our general scheme makes it possible to treat at the same time many well-known calculi such as ## , ## # and ## , or some other new calculi that we

Linear Objects: logical processes with built-in inheritance

by Jean-Marc Andreoli, Remo Pareschi , 1990
"... We present a new framework for amalgamating two successful programming paradigms: logic programming and object-oriented programming. From the former, we keep the declarative reading of programs. From the latter, we select two crucial notions: (i) the ability for objects to dynamically change their ..."
Abstract - Cited by 206 (6 self) - Add to MetaCart
we call Linear Objects, based on the possibility of having multiple literals in the head of a program clause. This contains within itself the basis for a flexible form of inheritance, and maintains the constructive property of Prolog of returning definite answer substitutions as output

Tableau calculi for answer set programming

by Martin Gebser, Torsten Schaub - PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP’06 , 2006
"... We introduce a formal proof system based on tableau methods for analyzing computations made in Answer Set Programming (ASP). Our approach furnishes declarative and fine-grained instruments for characterizing operations as well as strategies of ASP-solvers. First, the granulation is detailed enough ..."
Abstract - Cited by 23 (6 self) - Add to MetaCart
to capture the variety of propagation and choice operations of algorithms used for ASP; this also includes SAT-based approaches. Second, it is general enough to encompass the various strategies pursued by existing ASP-solvers. This provides us with a uniform framework for identifying and comparing

λν, a Calculus of Explicit Substitutions which Preserves Strong Normalisation

by Zine-el-abidine Benaissa, Daniel Briaud, Pierre Lescanne, Jocelyne Rouyer-degli, Projet Eureca , 1995
"... Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and Lévy to internalise substitutions into λ-calculus and to propose a mechanism for computing on substitutions. λν is another view of the same concept which aims to explain the process of substituti ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and Lévy to internalise substitutions into λ-calculus and to propose a mechanism for computing on substitutions. λν is another view of the same concept which aims to explain the process

Tableau Calculi for Logic Programs under Answer Set Semantics

by Martin Gebser, Torsten Schaub
"... We introduce formal proof systems based on tableau methods for analyzing computations in Answer Set Programming (ASP). Our approach furnishes fine-grained instruments for characterizing operations as well as strategies of ASP solvers. The granularity is detailed enough to capture a variety of propag ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
atomic operations. Furthermore, our framework is flexible enough to integrate new inference patterns, and so to study their relation to existing ones. To this end, we generalize our approach and provide an extensible basis aiming at a modular incorporation of additional language constructs

Indicators for Social and Economic Coping Capacity - Moving Toward a Working Definition of Adaptive Capacity”, Wesleyan-CMU Working Paper.

by Gary Yohe , Richard S J Tol , Gary Yohe , 2001
"... Abstract This paper offers a practically motivated method for evaluating systems' abilities to handle external stress. The method is designed to assess the potential contributions of various adaptation options to improving systems' coping capacities by focusing attention directly on the u ..."
Abstract - Cited by 109 (14 self) - Add to MetaCart
on the underlying determinants of adaptive capacity. The method should be sufficiently flexible to accommodate diverse applications whose contexts are location specific and path dependent without imposing the straightjacket constraints of a "one size fits all" cookbook approach. Nonetheless, the method
Results 1 - 10 of 178