Skip to main content Accessibility help
×
Home

Normalization by evaluation with typed abstract syntax

  • OLIVIER DANVY (a1), MORTEN RHIGER (a1) and KRISTOFFER H. ROSE (a2)

Abstract

In higher-order abstract syntax, the variables and bindings of an object language are represented by variables and bindings of a meta-language. Let us consider the simply typed λ-calculus as object language and Haskell as meta-language. For concreteness, we also throw in integers and addition, but only in this section.

Copyright

Related content

Powered by UNSILO

Normalization by evaluation with typed abstract syntax

  • OLIVIER DANVY (a1), MORTEN RHIGER (a1) and KRISTOFFER H. ROSE (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

Normalization by evaluation with typed abstract syntax

  • OLIVIER DANVY (a1), MORTEN RHIGER (a1) and KRISTOFFER H. ROSE (a2)
Submit a response

Discussions

No Discussions have been published for this article.

×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *