Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
We develop a calculus for lazy functional programming based on recursion operators associated with data type definitions. For these operators we derive various algebraic laws that are useful in deriving and manipulating programs. We shall show that all example functions in Bird and Wadler's "Introduction to Functional Programming" can be expressed using these operators.
Main.dvi
Functional Programming with Structured Graphs Bruno C. d. S. Oliveira National University of Singapore oliveira@comp.nus.edu.sg William R. Cook University of Texas, Austin wcook@cs.utexas.edu Abstract This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend con- ventional algebraic datatypes with explicit definition and manip- u
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Why Functional Programming Matters Part 2
Why Functional Programming Matters
