Sciweavers

21 search results - page 1 / 5
» Addressed term rewriting systems: application to a typed obj...
Sort
View
MSCS
2006
87views more  MSCS 2006»
13 years 4 months ago
Addressed term rewriting systems: application to a typed object calculus
Daniel J. Dougherty, Pierre Lescanne, Luigi Liquor...
ENTCS
2000
80views more  ENTCS 2000»
13 years 4 months ago
The simply typed rewriting calculus
The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explic...
Horatiu Cirstea, Claude Kirchner
ENTCS
2002
128views more  ENTCS 2002»
13 years 4 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 2 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
IWPC
2003
IEEE
13 years 10 months ago
How Understanding and Restructuring Differ from Compiling - A Rewriting Perspective
Syntactic and semantic analysis are established topics in the area of compiler construction. Their application to the understanding and restructuring of large software systems rev...
Paul Klint