Lambda in Motion: Controlling Robots with Haskell

Peterson, John; Hudak, Paul; Elliott, Conal

doi:10.1007/3-540-49201-1_7

Cited by 53 publications

(38 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both problems are easily solved with additional intermediate types (like PreCase) and more elaborate schemes, but are beyond the scope of this simple example. Other methods of embedding syntax are described or used in other work such as [15,13,14].…”

Section: Critical Withmentioning

confidence: 99%

Declarative Scripting in Haskell

Bauer

Erwig

2010

Software Language Engineering

View full text Add to dashboard Cite

Abstract. We present a domain-specific language embedded within the Haskell programming language to build scripts in a declarative and typesafe manner. We can categorize script components into various orthogonal dimensions, or concerns, such as IO interaction, configuration, or error handling. In particular, we provide special support for two dimensions that are often neglected in scripting languages, namely creating deadlines for computations and tagging and tracing of computations. Arbitrary computations may be annotated with a textual tag explaining its purpose. Upon failure a detailed context for that error is automatically produced. The deadline combinator allows one to set a timeout on an operation. If it fails to complete within that amount of time, the computation is aborted. Moreover, this combinator works with the tag combinator so as to produce a contextual trace.

show abstract

Section: Critical Withmentioning

confidence: 99%

Declarative Scripting in Haskell

Bauer

Erwig

2010

Software Language Engineering

View full text Add to dashboard Cite

show abstract

“…This is based on the reactive programming paradigm [22][23][24], which requires a reactive version of the AmbientTalk interpreter [25]. Concretely, the dataflow variables in the operator code denote reactive values.…”

Section: Propagating Events and Reacting To Eventsmentioning

confidence: 99%

A Hybrid Visual Dataflow Language for Coordination in Mobile Ad Hoc Networks

Carreton¹,

D'Hondt²

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

International audienceBecause of the dynamic nature of mobile ad hoc networks and the applications running on top of them, these applications have to be conceived as event-driven architectures. Such architectures are hard to program because coordination between concurrent and distributed mobile components has to be expressed by means of event handlers or callbacks. Applications consisting of disjoint event handlers that are independently triggered (possibly by their environment) exhibit a very implicit control flow that is hard to grasp. This paper presents a visual dataflow language tailored towards mobile applications to express the interaction between mobile components that operate on data streams. By using a visual dataflow language as a separate coordination language, the coarse grained control flow of a mobile application can be specified visually and separately from the fine grained control flow. In its turn, this allows a very explicit view on the control flow of the entire mobile application

show abstract

“…A monad is used to describe computations and how to combine these computations to generate new computations. For this reason monads are frequently used to embed domain specific languages in functional languages for many different purposes, e.g., I/O and concurrency [20], Parsers [13], controlling robots [19], and memory transactions [7]. A monad can be implemented as an abstract data type that represents a container for a computation.…”

Section: Monadsmentioning

confidence: 99%

A Domain Specific Language for Composable Memory Transactions in Java

Bois

Echevarria

2009

Domain-Specific Languages

View full text Add to dashboard Cite

Abstract. In this paper we present CMTJava, a domain specific language for composable memory transactions [7] in Java. CMTJava provides the abstraction of transactional objects. Transactional objects have their fields accessed only by special get and set methods that are automatically generated by the compiler. These methods return transactional actions as a result. A transactional action is an action that, when executed, will produce the desired effect. Transactional actions can only be executed by the atomic method. Transactional actions are first class values in Java and they are composable: transactions can be combined to generate new transactions. The Java type system guarantees that the fields of transactional objects will never be accessed outside a transaction. CMTJava supports the retry and orElse constructs from STM Haskell. To validate our design we implemented a simple transactional system following the description of the original Haskell system. CMTJava is implemented as a state passing monad using BBGA closures, a Java extension that supports closures in Java.

show abstract

Lambda in Motion: Controlling Robots with Haskell

Cited by 53 publications

References 8 publications

Declarative Scripting in Haskell

Declarative Scripting in Haskell

A Hybrid Visual Dataflow Language for Coordination in Mobile Ad Hoc Networks

A Domain Specific Language for Composable Memory Transactions in Java

Contact Info

Product

Resources

About