Add to ORKGHigher-Order Transformations, or HOTs, are transformations which receive a model of a transformation as input and produce a model of a transformation as output [2]. A specific use-case for HOTs is the evolution of domain-specific languages, where HOTs are constructe
The central concept of the Evolving Transformation System (ETS) model is struc-tural object represen...
HOT is an automated higher-order theorem prover based on HTE, an extensional higher-order tableaux c...
Abstract: The paper describes the algorithm of the supercompiler HOSC 1.5, an experimental...
International audienceThe level of maturity that has been reached by model transformation technologi...
This paper describes a tableau-based higher-order theorem prover HOT and an application to natural l...
Abstract: Model transformation specifications are currently bound to a specific transformation execu...
Chillies is a novel approach for variable model transformations closing the gap between abstract arc...
For about two decades, researchers have been constructing tools for applying graph transformations o...
howe@scs.carleton.ca Higher-Order Abstract Syntax, or HOAS, is a technique for using a higher-order ...
This paper is concerned with semantic theories of higher order communicating systems (HOCS). In thes...
This short paper summarizes the work I have done over the last years on the use of higher-order Desc...
Transformations that are based on syntax directed rewriting systems can have a significant impact on...
Transformations that are based on syntax directed rewriting systems can have a significant impact on...
In this paper, we reexamine the problem of general higher-order unification and develop an approach ...
A small but powerful language for higher-order nondeterministic processes is introduced. Its roots i...
The central concept of the Evolving Transformation System (ETS) model is struc-tural object represen...
HOT is an automated higher-order theorem prover based on HTE, an extensional higher-order tableaux c...
Abstract: The paper describes the algorithm of the supercompiler HOSC 1.5, an experimental...
International audienceThe level of maturity that has been reached by model transformation technologi...
This paper describes a tableau-based higher-order theorem prover HOT and an application to natural l...
Abstract: Model transformation specifications are currently bound to a specific transformation execu...
Chillies is a novel approach for variable model transformations closing the gap between abstract arc...
For about two decades, researchers have been constructing tools for applying graph transformations o...
howe@scs.carleton.ca Higher-Order Abstract Syntax, or HOAS, is a technique for using a higher-order ...
This paper is concerned with semantic theories of higher order communicating systems (HOCS). In thes...
This short paper summarizes the work I have done over the last years on the use of higher-order Desc...
Transformations that are based on syntax directed rewriting systems can have a significant impact on...
Transformations that are based on syntax directed rewriting systems can have a significant impact on...
In this paper, we reexamine the problem of general higher-order unification and develop an approach ...
A small but powerful language for higher-order nondeterministic processes is introduced. Its roots i...
The central concept of the Evolving Transformation System (ETS) model is struc-tural object represen...
HOT is an automated higher-order theorem prover based on HTE, an extensional higher-order tableaux c...
Abstract: The paper describes the algorithm of the supercompiler HOSC 1.5, an experimental...