The transient combinator, higher-order strategies, and the distributed data problem
Reads0
Chats0
TLDR
A strategic combinator called transient and a strategic constant called skip are introduced in the context of a higher-order strategic framework that allows the manipulation of data to be expressed directly in strategic terms.About:
This article is published in Science of Computer Programming.The article was published on 2004-08-01 and is currently open access. It has received 27 citations till now. The article focuses on the topics: Program transformation & Combinatory logic.read more
Citations
More filters
Book ChapterDOI
Program transformation using HATS 1.84
Victor Winter,Jason Beranek +1 more
TL;DR: An overview of a transformation system called HATS, a freely available platform independent IDE facilitating experimentation in transformation-oriented software development, is given.
Journal ArticleDOI
A new fault detection method for computer networks
TL;DR: A new fault detection method, whose key is to divide the detection process into multiple stages, which can guarantee that the traffic used by probes during each detection stage is small sufficiently so that the network can operate without severe disturbance from probes.
Journal ArticleDOI
Strategy Construction in the Higher-Order Framework of TL
TL;DR: Higher-order mechanisms capable of dynamically constructing strategic expressions that are similar to rule bases are described, which can be constructed using arbitrary binary combinators and obtained through term traversals.
Proceedings ArticleDOI
The SSP: an example of high-assurance systems engineering
TL;DR: The SSP is a high assurance systems engineering effort spanning both hardware and software that combines extensive design review, first principle design, n-version programming, program transformation, verification, and consistency checking.
Journal ArticleDOI
Programming errors in traversal programs over structured data
TL;DR: Based on an inventory of possible programming errors, options of static typing and static analysis are explored so that some categories of errors can be avoided and suggest suggestions for improvements to strategy libraries as well as their underlying programming languages.
References
More filters
Book
The Java Virtual Machine Specification
Tim Lindholm,Frank Yellin +1 more
TL;DR: In this article, the authors present a detailed overview of the Java Virtual Machine, including the internal structure of the class file format, the internal form of Fully Qualified Class and Interface names, and the implementation of new class instances.
Journal ArticleDOI
Constructing Induction Rules for Deductive Synthesis Proofs
TL;DR: It is shown that a combination of rippling and the use of meta-variables as a least-commitment device can provide novelty in induction rule construction techniques that can introduce novel recursive structures.
Journal ArticleDOI
A theory of type polymorphism in programming
TL;DR: This work presents a formal type discipline for polymorphic procedures in the context of a simple programming language, and a compile time type-checking algorithm w which enforces the discipline.
Book
Types and Programming Languages
TL;DR: This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages, with a variety of approaches to modeling the features of object-oriented languages.
Journal ArticleDOI
Maude: specification and programming in rewriting logic
Manuel Clavel,Francisco Durán,Steven Eker,Patrick Lincoln,Narciso Martí-Oliet,José Meseguer,José F. Quesada +6 more
TL;DR: The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques, and explains and illustrates with examples the main concepts of Maude's language design including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views.