A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization (Artifact)

نویسندگان

  • Avraham Shinnar
  • Jérôme Siméon
  • Martin Hirzel
چکیده

This artifact contains the accompanying code for the ECOOP 2015 paper: “A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization”. It contains source files for a full mechanization of the three languages presented in the paper: CAMP (Calculus for Aggregating Matching Patterns), NRA (Nested Relational Algebra) and NNRC (Named Nested Relational Calculus). Translations between all three languages and their attendant proofs of correctness are included. Additionally, a mechanization of a type system for the main languages is provided, along with bidirectional proofs of type preservation and proofs of the time complexity of the various compilers. 1998 ACM Subject Classification I.2.5 Programming Languages and Software: Expert system tools and techniques, D.3.3 Language Constructs and Features: Patterns, H.2.3 Languages: Query Languages

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization

This paper introduces a core calculus for pattern-matching in production rule languages: the Calculus for Aggregating Matching Patterns (CAMP). CAMP is expressive enough to capture modern rule languages such as JRules, including extensions for aggregation. We show how CAMP can be compiled into a nested-relational algebra (NRA), with only minimal extension. This paves the way for applying relati...

متن کامل

Asynchronous Process Calculi: the Rst-order and Higher-order Paradigms (tutorial)

We compare the rst-order and the higher-order paradigms for the representation of mobility in process calculi. The prototypical calculus in the rst-order paradigm is the-calculus. Here, we focus on an asynchronous-calculus (L) that may be regarded as the basis of some experimental programming languages (or proposal of programming languages) like Pict, Join, Blue. We extend L so to allow the com...

متن کامل

On the Expressiveness of Joining

The expressiveness of communication primitives has been explored in a common framework based on the π-calculus by considering four features: synchronism (asynchronous vs synchronous), arity (monadic vs polyadic data), communication medium (shared dataspaces vs channel-based), and pattern-matching (binding to a name vs testing name equality vs intensionality). Here another dimension coordination...

متن کامل

A formal approach to the analysis of clinical workflow languages

Objective: To develop proof strategies to formally study the expressiveness of workflow-based languages, and to investigate their applicability to clinical workflow languages. Method: We propose two strategies for studying the expressiveness of workflow-based languages based on a standard set of workflow patterns expressed as Petri Nets and notions of congruence and bisimilarity from process ca...

متن کامل

Towards a Knowledge Compilation Map for Heterogeneous Representation Languages

The knowledge compilation map introduced by Darwiche and Marquis takes advantage of a number of concepts (mainly queries, transformations, expressiveness, and succinctness) to compare the relative adequacy of representation languages to some AI problems. However, the framework is limited to the comparison of languages that are interpreted in a homogeneous way (formulæ are interpreted as Boolean...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • DARTS

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2015