Frédéric Blanqui
Frédéric Blanqui
There are a few problems with ";": - the parser and the printers are not consistent on metavariable arguments: the parser uses ";" and the printers "," - ";" is...
introduced in #552
Example: x:A:=a |- t = u.
This field would be set after checking subjection reduction. This would simplify termination and confluence checking. Note that it is important that termination and confluence checking is fast. Otherwise people...
In a rule LHS, type annotations of abstractions are replaced by the *same* variable m_typ: https://github.com/Deducteam/lambdapi/blob/82dccc5074bd42574d8d21b9b39527052d2014cd/src/core/hrs.ml#L38
We currently have no tools to compile a set of LP files. If in your project you have two files a.lp and b.lp with a.lp depending on b.lp, then a.lp...
@rlepigre proposes to define notations with « place-holders » with priorities like: - "if _ then _ else _", - "_ ⊢ _ : _", _ "⟦ _ ⟧", -...
https://github.com/Deducteam/lambdapi/blob/3b25ff1cfec2b65f37a9199c349eeded7f3888d3/src/parser.ml#L238 Currently a module name must be any_ident, that is, an escaped_ident or a regular_ident but regular_ident must be different from keywords: https://github.com/Deducteam/lambdapi/blob/3b25ff1cfec2b65f37a9199c349eeded7f3888d3/src/parser.ml#L223 This exclude filenames like set, simpl, intro,...
Currently, the following file is not accepted: ``` symbol R:TYPE symbol sin:R⇒R symbol D:(R⇒R)⇒(R⇒R) rule D(λx,sin &F[x]) → λx:R,x assert D sin ≡ λx:R,x ```
With the following code: ``` Inductive paths {A : Type} (a : A) : A -> Type := idpath : paths a a. Scheme paths_ind := Induction for paths Sort...