Skip to main content
added 36 characters in body; edited title
Source Link

Normalization-by-evaluation algorithmfor untyped lambda calculus which results in beta𝛽𝜂-eta normalnormal form

Usual NbE algorithms for untyped lambda calculus, which use (P)HOAS to embed terms to a host language constructs, results in a beta-normal form of a terms.

Is there algorithms to (efficiently) exploit host language constructs to normalize untyped terms to beta-eta normal form?

Normalization-by-evaluation algorithm which results in beta-eta normal form

Usual NbE algorithms, which use (P)HOAS to embed terms to a host language constructs, results in a beta-normal form of a terms.

Is there algorithms to (efficiently) exploit host language constructs to normalize terms to beta-eta normal form?

Normalization-by-evaluation for untyped lambda calculus which results in 𝛽𝜂-normal form

Usual NbE algorithms for untyped lambda calculus, which use (P)HOAS to embed terms to a host language constructs, results in a beta-normal form of a terms.

Is there algorithms to (efficiently) exploit host language constructs to normalize untyped terms to beta-eta normal form?

Source Link

Normalization-by-evaluation algorithm which results in beta-eta normal form

Usual NbE algorithms, which use (P)HOAS to embed terms to a host language constructs, results in a beta-normal form of a terms.

Is there algorithms to (efficiently) exploit host language constructs to normalize terms to beta-eta normal form?