We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
As per my "demand-indexed computation" experiment. Imported from rolyp/lambdacalc-old#4.
Trie
Constr
Trie.Var
Trie.Prim
PrimOp
Expr.OpName
Expr.Var
Trie.Constr
match..as
The text was updated successfully, but these errors were encountered:
No branches or pull requests
As per my "demand-indexed computation" experiment. Imported from rolyp/lambdacalc-old#4.
Trie
datatype, analogous toConstr
:Trie.Var
maps any argument to a continuation, plus environment binding the variableTrie.Prim
(?) that demands a strict value of primitive typePrimOp
should be an expression form?deleteExpr.OpName
(consolidate withExpr.Var
)Trie.Constr
case via nested tries**match..as
semantics, based on triesτ, υ to range over tries (υ for arbitrary tries, τ for non-empty ones)?ρ, σ to range over environments?The text was updated successfully, but these errors were encountered: