/explore
|
You are here 
|
boxbase.org | ||
| | | | |
gilmi.me
|
|
| | | | | m.me - Giml's type inference engine | |
| | | | |
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. | |
| | | | |
www.joachim-breitner.de
|
|
| | | | | [AI summary] A Haskell developer demonstrates how the rec-def library simplifies fixed-point calculation in recursive let bindings for program analysis. | |
| | | | |
aimatters.wordpress.com
|
|
| | | A few weeks ago, it was announced that Keras would be getting official Google support and would become part of the TensorFlow machine learning library. Keras is a collectionof high-level APIs in Python for creating and training neural networks, using either Theano or TensorFlow as the underlying engine. Given my previous posts on implementing an... | ||
