<--- Back to Details
First PageDocument Content
Software engineering / Declarative programming / Computer programming / Functional programming / Theoretical computer science / Data types / Type theory / Computability theory / Lambda calculus / Recursion / Algebraic data type / Anonymous function
Date: 2016-06-08 12:49:34
Software engineering
Declarative programming
Computer programming
Functional programming
Theoretical computer science
Data types
Type theory
Computability theory
Lambda calculus
Recursion
Algebraic data type
Anonymous function

PLDI: U: Type Assisted Synthesis of Recursive Transformers on Algebraic Datatypes Jeevana Priya Inala MIT Advisor: Armando Solar-Lezama

Add to Reading List

Source URL: www.acm.org

Download Document from Source Website

File Size: 344,49 KB

Share Document on Facebook

Similar Documents

Declarative Game Programming Distilled Tutorial Henrik Nilsson Ivan Perez

Declarative Game Programming Distilled Tutorial Henrik Nilsson Ivan Perez

DocID: 1xVd0 - View Document

Declarative and Logic Programming Mooly Sagiv Adapted from Peter Hawkins Jeff Ullman (Stanford)  Why declarative programming

Declarative and Logic Programming Mooly Sagiv Adapted from Peter Hawkins Jeff Ullman (Stanford) Why declarative programming

DocID: 1t69T - View Document

Introduction Grapefruit in detail Declarative Programming of Interactive Systems with Grapefruit Wolfgang Jeltsch

Introduction Grapefruit in detail Declarative Programming of Interactive Systems with Grapefruit Wolfgang Jeltsch

DocID: 1t583 - View Document

Chapter 14  Improving Push-based FRP Wolfgang Jeltsch1 Category: Research Abstract: Push-based implementations of Functional Reactive Programming allow for writing reactive programs in a declarative style and execute the

Chapter 14 Improving Push-based FRP Wolfgang Jeltsch1 Category: Research Abstract: Push-based implementations of Functional Reactive Programming allow for writing reactive programs in a declarative style and execute the

DocID: 1t1D0 - View Document

Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem Bernhard Bliem, Reinhard Pichler, and Stefan Woltran Institute of Information Systems, Vienna University of Technology {bliem, pichle

Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem Bernhard Bliem, Reinhard Pichler, and Stefan Woltran Institute of Information Systems, Vienna University of Technology {bliem, pichle

DocID: 1sWoH - View Document