| Age | Commit message (Collapse) | Author |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
runtime
|
|
|
|
|
|
|
|
category for every expression
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
and query for the list of languages
|
|
types in the abstract syntax
|
|
|
|
|
|
|
|
|
|
|
|
changes in the printer
|
|
|
|
trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
|
|
|
|
it is implicitly kept in the JIT compiled code
|
|
|
|
|
|
|
|
|
|
|
|
|
|
search. This is already used by the exhaustive generator. The time to generate 10000 abstract trees with ParseEng went down from 4.43 sec to 0.29 sec.
|
|
|
|
|
|
|