<--- Back to Details
First PageDocument Content
Mathematical logic / Logic in computer science / Applied mathematics / Rewriting / Unification / Semi-Thue system / Theoretical computer science / Mathematics / Formal languages
Date: 2002-12-11 10:42:01
Mathematical logic
Logic in computer science
Applied mathematics
Rewriting
Unification
Semi-Thue system
Theoretical computer science
Mathematics
Formal languages

An Algorithm Rules JEAN in Polynomial

Add to Reading List

Source URL: cs-pub.bu.edu

Download Document from Source Website

File Size: 907,90 KB

Share Document on Facebook

Similar Documents

Software engineering / Computing / Computer programming / Functional languages / Control flow / High-level programming languages / Programming language comparisons / Programming language syntax / Eval / JavaScript / Scope / Dynamic programming language

Isolating JavaScript with Filters, Rewriting, and Wrappers Sergio Maffeis1 , John C. Mitchell2 , and Ankur Taly2 1 Imperial College London

DocID: 1xV5b - View Document

Software engineering / Computing / Computer programming / Functional languages / Control flow / High-level programming languages / Programming language comparisons / Programming language syntax / Eval / JavaScript / Scope / Dynamic programming language

Isolating JavaScript with Filters, Rewriting, and Wrappers Sergio Maffeis1 , John C. Mitchell2 , and Ankur Taly2 1 Imperial College London

DocID: 1xUXR - View Document

Theoretical computer science / Mathematics / Graph theory / Formal languages / Logic in computer science / Graph rewriting / Mathematical logic / Rewriting / Graph / KnuthBendix completion algorithm / Abstract semantic graph / Tree

From Trees To Graphs: Understanding The Implications Of Sharing For Rewriting Student. Maria A Schett University of Innsbruck Technikerstrasse 21a

DocID: 1xU4a - View Document

Theoretical computer science / Programming language theory / Mathematics / Formal languages / Mathematical logic / Logic in computer science / Computability theory / Rewriting / Normal form / Graph rewriting / Pure / Term

Termgraph Rewriting Maria Schett Supervisors: Martin Avanzini, Georg Moser November 8, 2011

DocID: 1xU0R - View Document

Theoretical computer science / Formal languages / Mathematics / Discrete mathematics / Graph theory / Abstract semantic graph / Graph / Rewriting / Graph rewriting

From Trees to Graphs: On the Influence of Collapsing on Rewriting and on Termination Maria A Schett defensio: master thesis advised by Georg Moser department of CS @ UIBK Oktober 25, 2016

DocID: 1xTUh - View Document