/explore
|
You are here 
|
vlad.website | ||
| | | | |
twomorecents.org
[AI summary] This text is a detailed exploration of the development and implementation of a regular expression engine, drawing from the works of several key figures in the field. It covers various features and techniques, including capturing groups, backreferences, numeric ranges, and the use of threads to simulate backtracking. The author also discusses the inspiration from Russ Cox, Rob Pike, and Ken Thompson, and their contributions to the field of regular expressions and computing. |
|
| | | | | ||
| | | | |
harelang.org
[AI summary] The developer of the Hare programming language explains the design, implementation, and usage of its POSIX-compatible regular expression engine, detailing how it uses finite state automata and instruction-based virtual threads to ensure linear-time matching. |
|
| | | | | ||
| | | | |
mathiasbynens.be
[AI summary] The article discusses recent advancements in ECMAScript regular expressions, including new features like dotAll mode, lookbehind assertions, named capture groups, Unicode property escapes, and set notation, along with proposals for further enhancements. |
|
| | | | | ||
| | | | |
kuruczgy.com
[AI summary] The article explores the intersection of functional programming and logic through the lens of dependent types. It begins with foundational concepts like type constructors and inductive types, then delves into the Curry-Howard isomorphism, which links programs to mathematical proofs. The discussion covers how types represent propositions, functions as implications, and inductive types as proof strategies. Examples include defining logical relations like less than or equal to and equality, and demonstrating how to prove properties like universal quantification and mathematical identities. The article concludes with an overview of resources for further study in proof assistants like Coq and Idris, emphasizing the practical applications of dependent... |
|
| | | |||
