james
/
ivo
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
ivo/src/Ivo.hs

25 lines
587 B
Haskell
Raw Normal View History

Name the language Ivo.
2021-03-26 12:31:55 -07:00
module Ivo
( module Ivo.Evaluator
, module Ivo.Expression
, module Ivo.Syntax
, module Ivo.Types
Added support for Hindley-Milner type inference! I also generalized substitution to *all* expressions (and types), which itself involved a rewrite of the substitution function I already had. (In hindsight, I wish I'd done that in a separate commit.) The last four days have all been working up to this, so I'm glad I've finally managed to integrate it into this project! (I wrote the algorithm 4 days ago, but the infrastructure just wasn't there to add it here.)
2021-03-18 00:00:43 -07:00
, parseCheck, parseEval, unparseCheck, unparseEval
Cleanup: fix warnings, fix indentation, upgrade dependencies.
2021-03-05 19:04:06 -08:00
) where
Make the printer smarter, separate intermediate AST data type. * The expression printer now knows how to use `let`, multi-argument lambdas and applications, and block arguments when appropriate. * There is a separate type, AbstractSyntax, which separates parsing/printing logic from removing/reintroducing the more advanced syntax described above. * Expression is now its own module because its 'show' depends on AbstractSyntax, and I don't want the ast2expr/expr2ast stuff to be in the same module as the real lambda calculus stuff.
2020-11-03 13:29:59 -08:00
Name the language Ivo.
2021-03-26 12:31:55 -07:00
import Ivo.Evaluator
import Ivo.Expression
import Ivo.Syntax
import Ivo.Types
Added support for Hindley-Milner type inference! I also generalized substitution to *all* expressions (and types), which itself involved a rewrite of the substitution function I already had. (In hindsight, I wish I'd done that in a separate commit.) The last four days have all been working up to this, so I'm glad I've finally managed to integrate it into this project! (I wrote the algorithm 4 days ago, but the infrastructure just wasn't there to add it here.)
2021-03-18 00:00:43 -07:00
parseCheck :: Text -> Either ParseError CheckExpr
parseCheck = fmap ast2check . parseAST
Make the printer smarter, separate intermediate AST data type. * The expression printer now knows how to use `let`, multi-argument lambdas and applications, and block arguments when appropriate. * There is a separate type, AbstractSyntax, which separates parsing/printing logic from removing/reintroducing the more advanced syntax described above. * Expression is now its own module because its 'show' depends on AbstractSyntax, and I don't want the ast2expr/expr2ast stuff to be in the same module as the real lambda calculus stuff.
2020-11-03 13:29:59 -08:00
Combine expression representations using the 'trees that grow' design pattern. Trees that grow introduces a lot of boilerplate but is bound to be essentially necessary when I add in the type checker and all sorts of builtin data types. (I know this because I already *implemented* those things; it's mostly a matter of trying to merge it all into this codebase). Accomplishing this also involved restructuring the project and rewriting a few algorithms in the process, but those changes are fundamentally intwined with this one.
2021-03-16 17:19:50 -07:00
parseEval :: Text -> Either ParseError EvalExpr
parseEval = fmap ast2eval . parseAST
Make the printer smarter, separate intermediate AST data type. * The expression printer now knows how to use `let`, multi-argument lambdas and applications, and block arguments when appropriate. * There is a separate type, AbstractSyntax, which separates parsing/printing logic from removing/reintroducing the more advanced syntax described above. * Expression is now its own module because its 'show' depends on AbstractSyntax, and I don't want the ast2expr/expr2ast stuff to be in the same module as the real lambda calculus stuff.
2020-11-03 13:29:59 -08:00
Added support for Hindley-Milner type inference! I also generalized substitution to *all* expressions (and types), which itself involved a rewrite of the substitution function I already had. (In hindsight, I wish I'd done that in a separate commit.) The last four days have all been working up to this, so I'm glad I've finally managed to integrate it into this project! (I wrote the algorithm 4 days ago, but the infrastructure just wasn't there to add it here.)
2021-03-18 00:00:43 -07:00
unparseCheck :: CheckExpr -> Text
unparseCheck = unparseAST . simplify . check2ast
Combine expression representations using the 'trees that grow' design pattern. Trees that grow introduces a lot of boilerplate but is bound to be essentially necessary when I add in the type checker and all sorts of builtin data types. (I know this because I already *implemented* those things; it's mostly a matter of trying to merge it all into this codebase). Accomplishing this also involved restructuring the project and rewriting a few algorithms in the process, but those changes are fundamentally intwined with this one.
2021-03-16 17:19:50 -07:00
unparseEval :: EvalExpr -> Text
unparseEval = unparseAST . simplify . eval2ast