activity
20042015
most citedDeclarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell

12 citations · 14 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LO2015★ 2 cited

A Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations

Paul Tarau

With sound unification, Definite Clause Grammars and compact expression of combinatorial generation algorithms, logic programming is shown to conveniently host a declarative playgr…

cs.PL2014

Interclausal Logic Variables

Paul Tarau, Fahmida Hamid

Unification of logic variables instantly connects present and future observations of their value, independently of their location in the data areas of the runtime system. The paper…

cs.PL2011

The BinProlog Experience: Architecture and Implementation Choices for Continuation Passing Prolog and First-Class Logic Engines

Paul Tarau

We describe the BinProlog system's compilation technology, runtime system and its extensions supporting first-class Logic Engines while providing a short history of its development…

cs.PL2008★ 12 cited

Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell

Paul Tarau

This paper is an exploration in a functional programming framework of {\em isomorphisms} between elementary data types (natural numbers, sets, multisets, finite functions, permutat…

cs.PL2004

High-Level Networking With Mobile Code And First Order AND-Continuations

Paul Tarau, Veronica Dahl

We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehens…