Results 11 
19 of
19
The Stratego Compiler
 Institute of Information and Computing Sciences, Universiteit
, 1999
"... Software System Families Current research and practical experience suggest that achieving significant progress with respect to software reuse requires a paradigm shift towards modeling and developing software system families rather than individual systems. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Software System Families Current research and practical experience suggest that achieving significant progress with respect to software reuse requires a paradigm shift towards modeling and developing software system families rather than individual systems.
Foundations of the RuleBased System ρLog
"... ABSTRACT. We describe the foundations of a system for rulebased programming which integrates two powerful mechanisms: (1) matching with context variables, sequence variables, and regular constraints for their matching values; and (2) strategic programming with labeled rules. The system is called ρL ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
ABSTRACT. We describe the foundations of a system for rulebased programming which integrates two powerful mechanisms: (1) matching with context variables, sequence variables, and regular constraints for their matching values; and (2) strategic programming with labeled rules. The system is called ρLog, and is built on top of the pattern matching and rulebased programming capabilities of Mathematica. KEYWORDS: Rulebased programming, declarative programming, matching. 1.
Superdeduction at Work
"... Abstract Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a systematic, correct and complete way. We prove in detail the strong normalization of a proof term language that ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a systematic, correct and complete way. We prove in detail the strong normalization of a proof term language that models appropriately superdeduction. We finaly examplify on several examples, including equality and noetherian induction, the usefulness of this approach which is implemented in the lemuridæ system, written in TOM. 1
Generation of Program Transformation Systems
"... roduce the appropriate rewriting implementation. We will compare our strategy language with several formalisms under development elsewhere and evaluate its adequacy by using it in three demanding program transformation applications: ffl sourcetosource optimization of seismic and other numerical C ..."
Abstract
 Add to MetaCart
roduce the appropriate rewriting implementation. We will compare our strategy language with several formalisms under development elsewhere and evaluate its adequacy by using it in three demanding program transformation applications: ffl sourcetosource optimization of seismic and other numerical C++ software in the highlevel SOPHUS style under development at the University of Bergen (Norway); ffl transformations for the RML optimizing functional language compiler in cooperation with the Oregon Graduate Institute and Portland State University; ffl Cobol transformations for reengineering purposes in cooperation with the University of Amsterdam. 0.5 Classification Computing Reviews classification categories D2.2, D2.7, D.3.4. 0.6 Support requested year 1 year 2 year 3 year 4 year 5 personnel (fte) postdoc 1 1 oio other expenses (kFl.) personnel (total) a a material other b b
Strategies in Automated Deduction (STRATEGIES'99)
, 1999
"... ) . . . . . . . . 33 Didier Galmiche Annotated Reasoning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 Dieter Hutter An Approach to Flexible Forms of Proof Control for a FirstOrder Inductive Theorem Prover (Extended Abstract) . . . 51 Ulrich Kuhler Proof ..."
Abstract
 Add to MetaCart
) . . . . . . . . 33 Didier Galmiche Annotated Reasoning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 Dieter Hutter An Approach to Flexible Forms of Proof Control for a FirstOrder Inductive Theorem Prover (Extended Abstract) . . . 51 Ulrich Kuhler Proof Planning with Multiple Strategies II . . . . . . . . . . . . . . . . . . . . 61 Erica Melis and Andreas Meier A Bootstrapped Compiler for Strategies (Extended Abstract) . . 73 Eelco Visser iii iv Workshop Programme 08:45  08:55 Opening 08:55  09:40 A Critique of Proof Planning (INVITED TALK) Alan Bundy (Univ. of Edinburgh) 09:40  10:05 Proof Planning with Multiple Strategies II Erica Melis, Andreas Meier (Univ. des Saarlandes) 10:05  10:30 Proof Planning using Strategic Methods Lassaad Cheikhrouhou (Univ. des Saarlandes) 10:30  11:00 COFFEE BREAK 11:00  11:25 Annotated Reasoning Dieter Hutter (DFKI Saarbrucken) 11:25  11:50 An Approach to Flexible Forms of Proof...
Progress  A Transformation Factory For Digital Signal Processing Software
"... C transformations Implementation Code DSP Specication Implementation Code hand coding formalize formalize formalize abstract Figure 3: Production of DSP implementation code by means of program transformation. A specication is gradually transformed to an implementation via a number of i ..."
Abstract
 Add to MetaCart
C transformations Implementation Code DSP Specication Implementation Code hand coding formalize formalize formalize abstract Figure 3: Production of DSP implementation code by means of program transformation. A specication is gradually transformed to an implementation via a number of intermediate formats. Each such `big step' transformation consists of a large number of small, local transformation steps. The specication of the transformation process formalizes the implicit knowledge that is currently applied in the hand coding of implementations. 7 Section: Project Description SPECIFYING PROGRAM TRANSFORMATION SYSTEMS WITH STRATEGO In order to make the DSP implementations maintainable it is crucial that the transformation system itself can easily be adapted. Stratego is a language for the specication of program transformation systems that has been designed to make the specication of transformation systems themselves maintainable and adaptable through the sepa...
Abstract
, 2002
"... A typed model of strategic term rewriting is developed. The key innovation is that generic. The calculus traversal is covered. To this end, we define a typed rewriting calculus S ′ γ employs a manysorted type system extended by designated generic strategy types γ. We consider two generic strategy t ..."
Abstract
 Add to MetaCart
A typed model of strategic term rewriting is developed. The key innovation is that generic. The calculus traversal is covered. To this end, we define a typed rewriting calculus S ′ γ employs a manysorted type system extended by designated generic strategy types γ. We consider two generic strategy types, namely the types of typepreserving and typeunifying strategies. S ′ γ offers traversal combinators to construct traversals or schemes thereof from manysorted and generic strategies. The traversal combinators model different forms of onestep traversal, that is, they process the immediate subterms of a given term without anticipating any scheme of recursion into terms. To inhabit generic types, we need to add a fundamental combinator to lift a manysorted strategy s to a generic type γ. This step is called strategy extension. The semantics of the corresponding combinator states that s is only applied if the type of the term at hand fits, otherwise the extended strategy fails. This approach dictates that the semantics of strategy application must be typedependent to a certain extent. Typed strategic term rewriting with coverage of generic term traversal is a simple but expressive model of generic programming. It has applications in program