Higher Order Functions Considered Unnecessary for Higher Order Programming (1990)

Cached

Download Links

by Joseph A. Goguen
Venue:SRI International, 333 Ravenswood Ave., Menlo Park CA 94025
Citations:8 - 0 self

Documents Related by Co-Citation

1305 Monads for functional programming – Philip Wadler - 1995
208 Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations – Joseph A. Goguen - 1992
273 An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types – J A Goguen, J W Thatcher, E G Wagner - 1978
423 Introduction to Higher Order Categorical Logic – J Lambek, P Scott - 1986
536 The Implementation of Functional Programming Languages – Simon L Peyton Jones - 1987
176 An overview of -prolog – D Miller, G Nadathur - 1988
87 Higher-order extensions to Prolog: are they needed – D H D Warren - 1982
60 Higher-Order Horn Clauses – Gopalan Nadathur, Dale Miller - 1990
215 An introduction to the theory of lists – R S Bird - 1987
730 Notions of Computation and Monads – Eugenio Moggi - 1991
919 Categories for the working mathematician – Mac Lane, S - 1971
3 An introduction to the algebraic specification of abstract data types. Available online – Jean Baillie - 1989
3 A survey of higher-order algebra – Karl Meinke - 1995
6 On the existence of initial models for partial (higher-order) conditional specifications – E Astesiano, M Cerioli - 1989
4 Theory of Computation: An introduction – J L Hein - 1996
3 Category Theory in Four Easy Movements – Harold Simmons, Andrea Schalk - 2003
4 Type theories and object-oriented programmimg – Scott Danforth, Chris Tomlinson - 1988
23 A gentle introduction to category theory --- the calculational approach – Maarten M. Fokkinga - 1992
23 theories and freeness: an introduction for computer scientists’, in: Theoretical Foundations of Programming Methodology, edited by M. Wirsing and G – R Burstall, J Goguen, ‘Algebras - 1982