|
|
|
|
|
|
by smt1
2018 days ago
|
|
|
Take a look at F#'s type solver code especially wrt to Extension Typing: https://github.com/dotnet/fsharp/blob/main/src/fsharp/Extens... You can do similar things with other Ocaml or Lispy Langs, depending on how you want to do it. All you need is a function that returns possibleTypeTransitions for givenType(type, enclosedLexeme, type.validTransitions). A gradually typed lang sitting in top of a prototype-based blob also makes this easy to do (see typescript) in-codo. See also MacKay (RIP)'s classic book:
http://www.inference.org.uk/itprnn/book.pdf |
|
|