First Page | Document Content | |
---|---|---|
![]() Date: 2012-11-17 18:09:06Subroutines Functional programming Lambda calculus Anonymous function Closure Function Higher-order function XSLT Haskell 98 features Software engineering Computing Declarative programming | Add to Reading List |
![]() | A brief introduction to Higher Order Logic and the HOL proof assistant Monica NesiDocID: 1rjEK - View Document |
![]() | Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values ofDocID: 1rghj - View Document |
![]() | 02157 Functional Programming - Tagged values and Higher-order list functionsDocID: 1rahU - View Document |
![]() | Scala By Example June 11, 2014 Martin OderskyDocID: 1r8S2 - View Document |
![]() | Nordic Journal of Computing ON INTRODUCING HIGHER ORDER FUNCTIONS IN ABEL BJØRN KRISTOFFERSEN Department of Mathemathics and InformaticsDocID: 1qyED - View Document |