the proceedings contain 13 papers. the special focus in this conference is on trends in functionalprogramming. the topics include: functional video games in the CS1 classroom;computErl – Erlang-based framework for m...
ISBN:
(纸本)9783642229404
the proceedings contain 13 papers. the special focus in this conference is on trends in functionalprogramming. the topics include: functional video games in the CS1 classroom;computErl – Erlang-based framework for many task computing;monad factory: Type-indexed monads;typing coroutines;an expression processor: A case study in refactoring haskell programs;static balance checking for first-class modular systems of equations;graphical and incremental type inference: A graph transformation approach;Hygienic macros for ACL2;what’s the matter with Kansas Lava?;types and type families for hardware simulation and synthesis: the internals and externals of Kansas Lava;testing withfunctional reference implementations.
the proceedings contain 13 papers. the topics discussed include: evaluating call-by-need on the control stack;typing coroutines;an expression processor: a case study in refactoring Haskell programs;static balance chec...
ISBN:
(纸本)9783642229404
the proceedings contain 13 papers. the topics discussed include: evaluating call-by-need on the control stack;typing coroutines;an expression processor: a case study in refactoring Haskell programs;static balance checking for first-class modular systems of equations;graphical and incremental type inference: a graph transformation approach;what's the matter with Kansas lava?;types and type families for hardware simulation and synthesis: the internals and externals of Kansas lava;testing withfunctional reference implementations;every animation should have a beginning, a middle, and an end: a case study of using a functor-based animation language;functional video games in the CS1 classroom;ComputErl-Erlang-based framework for many task computing;and monad factory: type-indexed monads.
the proceedings contain 22 papers. the topics discussed include: programming with Boolean satisfaction;automated verification of higher-order functional programs;dependently-typed programming in GHC;call-by-value solv...
ISBN:
(纸本)9783642298219
the proceedings contain 22 papers. the topics discussed include: programming with Boolean satisfaction;automated verification of higher-order functional programs;dependently-typed programming in GHC;call-by-value solvability, revisited;compiling a functional logic language: the basic scheme;classical call-by-need sequent calculi: the unity of semantic artifacts;normal form bisimulations for delimited-control operators;declarative debugging of wrong and missing answers for SQL views;improving the performance of FD constraint solving in a CFLP system;a general implementation framework for tabled CLP;correct looping arrows from cyclic terms: traced categorical interpretation in Haskell;mutual exclusion by interpolation;parallel computation skeletons with premature termination property;and calculational developments of new parallel algorithms for size-constrained maximum-sum segment problems.
the proceedings contain 28 papers. the topics discussed include: session types for linear multithreaded functionalprogramming;automatic refactoring of Erlang programs;model-checking higher-order functions;a dynamical...
ISBN:
(纸本)9781605585680
the proceedings contain 28 papers. the topics discussed include: session types for linear multithreaded functionalprogramming;automatic refactoring of Erlang programs;model-checking higher-order functions;a dynamically customizable process-centered evaluation model;a higher-order logical framework for the algorithmic debugging and verification of declarative programs;alternation as a programming paradigm;set functions for functional logic programming;reasoning with hypothetical judgments and open terms in hybrid;an Isabelle/Hol-based model of Stratego-like traversal strategies;making induction manifest in modular AC12;implementing a fixed point semantics for a constraint deductive database based on hereditary Harrop formulas;algorithmic specifications in linear logic with subexponentials;a logical framework for configuration software;path-sensitive region analysis for mercury programs;and an embedded declarative data transformation language.
the proceedings contain 8 papers. the topics discussed include: design of classes;reimplementing the wheel: teaching compilers with a small self-contained one;teaching programming to novices using the codeBoot online ...
the proceedings contain 8 papers. the topics discussed include: design of classes;reimplementing the wheel: teaching compilers with a small self-contained one;teaching programming to novices using the codeBoot online environment;teaching simple constructive proofs with Haskell programs;teaching functional programmers logic and metatheory;engaging, large-scale functionalprogramming education in physical and virtual space;introduction to functional classes in CS1;and teaching interaction using state diagrams.
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the results of a corresponding ordinary operati...
详细信息
ISBN:
(纸本)9781605585680
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the results of a corresponding ordinary operation. A characteristic feature of our approach is the complete separation between a usually-non-deterministic operation and its possibly-non-deterministic arguments. this separation leads to the first provably order-independent approach to computing the set of values of non-deterministic expressions. the proof is provided within the framework of graph rewriting in constructor-based systems. We propose an abstract implementation of our approach and prove its independence of the order of evaluation. Our approach solves easily and naturally problems mishandled by current implementations of functional logic languages.
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functionalprogramming such as Strafunski or "S...
详细信息
ISBN:
(纸本)9781605585680
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functionalprogramming such as Strafunski or "Scrap your boilerplate". Such traversal strategies are distinctively based on one-layer traversal primitives from which traversal schemes are derived by recursive closure. We describe a mechanized, formal model of such strategies. the model covers two different semantics of strategies, strategic programming laws, termination conditions for strategy combinators as well as properties related to the success/failure behavior of strategies. the model has been mechanized in Isabelle/HOL.
Monads provide a greatly useful capability to pure languages in simulating side-effects, but implementations such as the Monad Transformer Library [1] in Haskell prohibit reuse of those side-effects such as threading ...
详细信息
ISBN:
(纸本)9783642229404
Monads provide a greatly useful capability to pure languages in simulating side-effects, but implementations such as the Monad Transformer Library [1] in Haskell prohibit reuse of those side-effects such as threading through two different states without some explicit work-around. Monad Factory provides a straightforward solution for opening the non-proper morphisms by indexing monads at boththe type-level and term-level, allowing 'copies' of the monads to be created and simultaneously used within even the same monadic transformer stack. this expands monads' applicability and mitigates the amount of boilerplate code we need for monads to work together, and yet we use them nearly identically to non-indexed monads.
this paper focuses on introducing function related refactorings in RefactorErl, a refactoring tool for Erlang, namely the Extract Function Definition, the Generalize Function and the Inline Function. the purpose of th...
详细信息
the construction of reliable concurrent and distributed systems is an extremely difficult endeavour. For complex systems, it requires modular development strategies based on precise interface specifications that allow...
详细信息
ISBN:
(纸本)9781605585680
the construction of reliable concurrent and distributed systems is an extremely difficult endeavour. For complex systems, it requires modular development strategies based on precise interface specifications that allow the various modules to interact properly. In this extended abstract we are concerned with message passing systems where partners engage in long and complex interactions, as opposed to, say, remote procedure calls composed of a pair of simple interactions. Session types allow for the description of continuous series of interactions between several partners. In the simpler case, they detail protocols between two partners [Honda et al. 1998];recently the original setting was widened to encompass multiple partners [Honda et al. 2008]. In this paper we deal with binary sessions only. through a running example we visit session types and a functional concurrent language equipped with buffered semantics. Apart from the traditional "well typed programs do not go wrong", the semantics proposed allows for two extra interesting results: the ability to predict the required buffer size, and that of anticipating an output with respect to an input operation.
暂无评论