From post

Functional programming with bananas, lenses, envelopes and barbed wire

, , и . Functional Programming Languages and Computer Architecture, том 523 из Lecture Notes in Computer Science, Springer Berlin Heidelberg, (1991)
DOI: 10.1007/3540543961\_7

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

A Correctness Proof of Sorting by Means of Formal Procedures.. Sci. Comput. Program., 9 (3): 263-269 (1987)Ranking Query Results using Context-Aware Preferences., , , и . ICDE Workshops, стр. 269-276. IEEE Computer Society, (2007)Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire., , и . FPCA, том 523 из Lecture Notes in Computer Science, стр. 124-144. Springer, (1991)Axiomatization of Declarations and the Formal Treatment of an Escape Construct.. Formal Description of Programming Concepts, стр. 221-236. North-Holland, (1977)Modular Completeness for Communication Closed Layers., , и . CONCUR, том 715 из Lecture Notes in Computer Science, стр. 50-65. Springer, (1993)The associativity of equivalence and the Towers of Hanoi problem., и . Inf. Process. Lett., 77 (2-4): 71-76 (2001)Z-style notation for Probabilities.. TDM, том WP06-01 из CTIT Workshop Proceedings Series, стр. 19-24. Centre for Telematics and Information Technology (CTIT), University of Twente, Enschede, The Netherlands, (2006)Inductive assertion patters for recursive procedures.. Symposium on Programming, том 19 из Lecture Notes in Computer Science, стр. 221-233. Springer, (1974)Aligning Application Architecture to the Business Context., , , и . CAiSE, том 2681 из Lecture Notes in Computer Science, стр. 209-225. Springer, (2003)Subtyping Can Have a Simple Semantics., и . Theor. Comput. Sci., 87 (1): 81-96 (1991)