Sciweavers

172 search results - page 1 / 35
» Structure and Properties of Traces for Functional Programs
Sort
View
ENTCS
2007
112views more  ENTCS 2007»
13 years 4 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
PLPV
2012
ACM
11 years 12 months ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey
FM
2011
Springer
357views Formal Methods» more  FM 2011»
12 years 7 months ago
TraceContract: A Scala DSL for Trace Analysis
Abstract. In this paper we describe TRACECONTRACT, an API for trace analysis, implemented in the SCALA programming language. We argue that for certain forms of trace analysis the b...
Howard Barringer, Klaus Havelund
LISP
2008
96views more  LISP 2008»
13 years 4 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
ICFP
2007
ACM
14 years 4 months ago
Bidirectionalization transformation based on automatic derivation of view complement functions
Bidirectional transformation is a pair of transformations: a view function and a backward transformation. A view function maps one data structure called source onto another called...
Kazutaka Matsuda, Zhenjiang Hu, Keisuke Nakano, Ma...