|
You are here |
blog.alexdevero.com | ||
| | | | |
www.binovarghese.com
|
|
| | | | | A higher order function is a function that takes one or more functions as arguments, or returns a function as its result. | |
| | | | |
raganwald.com
|
|
| | | | | [AI summary] The text discusses the importance of functions as a fundamental and flexible element in JavaScript, highlighting how they can be combined in various ways. It explores different types of 'functions' such as classes, objects, and maps, and how they can be adapted to work with standard function tools. The text also mentions the need for adaptors and proxies to handle exceptions and variations in function behavior, and concludes with a note on the elegance of JavaScript's function model and its potential for creating reusable abstractions. | |
| | | | |
www.baturin.org
|
|
| | | | | [AI summary] The text provides an in-depth exploration of functional programming concepts in OCaml, focusing on type systems, pattern matching, and data structures. It covers topics such as unit and boolean values as sum types, polymorphic types like option and result, and the use of match expressions for pattern matching. The text also includes exercises for practicing these concepts, such as defining functions, writing sum types, and implementing pattern matching. | |
| | | | |
bloeys.com
|
|
| | | In 'Thought 2: Regex is Like Assembly' I wondered why we are still doing regex in this kind of hard to understand, symbolic way, when we have already invented high level programming languages. There is no reason regex can't be written as clearly as any other programming language we use today. I thought doing this would be an interesting project, and so I came up with Regexl, a high level language for writing regex, that can be used as a simple library. | ||