|
You are here |
blog.cy.md | ||
| | | | |
lambdaland.org
|
|
| | | | | All the source for this may be found on my SourceHut repository. Synopsis # Experimental type checker/inferer for a simple lambda calculus Description # This is a type inference system for a little language. (Described below.) It uses a fusion of type inference algorithms from PLAI, ESP, and ?Kanren. (See Resources) Broadly speaking, our type inference engine works by: generating typing constraints from the program solving those constraints Well describe each of those in more detail. | |
| | | | |
raganwald.com
|
|
| | | | | [AI summary] The article explains the nuances of named functions in JavaScript, contrasting declarations and expressions to highlight benefits for debugging and scope. | |
| | | | |
blog.spreendigital.de
|
|
| | | | | ||
| | | | |
spacedimp.com
|
|
| | | [AI summary] A beginner-friendly guide to overcoming the learning curve of Rust programming by exploring ownership, borrowing, and lifetimes. | ||