Higher-order abstract syntax

Known as: HOAS, Higher order abstract syntax 
In computer science, higher-order abstract syntax (abbreviated HOAS) is a technique for the representation of abstract syntax trees for languages… (More)
Wikipedia

Related topics

Related topics

23 relations
Abstract syntaxAbstract syntax treeBoilerplate codeCompiler
(More)

Broader (3)

Logic programmingProgramming language theoryType theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Compiling contextual objects: bringing higher-order abstract syntax to programmers
Binders in data-structures representing code or proofs can be represented in a variety of ways, from low-level first-order… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
2010
2010
Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison
A variety of logical frameworks support the use of higherorder abstract syntax (HOAS) in representing formal systems given via… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Parametric higher-order abstract syntax for mechanized semantics
We present parametric higher-order abstract syntax (PHOAS), a new approach to formalizing the syntax of programming languages in… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 9
Is this relevant?
Highly Cited
2008
Highly Cited
2008
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
Higher-order abstract syntax (HOAS) is a simple, powerful technique for implementing object languages, since it directly supports… (More)
Is this relevant?
2005
2005
Combining higher-order abstract syntax with first-order abstract syntax in ATS
Encodings based on higher-order abstract syntax represent the variables of an object-language as the variables of a meta-language… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Reasoning with higher-order abstract syntax in a logical framework
Logical frameworks based on intuitionistic or linear logics with higher-type quantification have been successfully used to give… (More)
  • table I
  • table II
  • table IV
  • table V
  • table VIII
Is this relevant?
2001
2001
Primitive recursion for higher-order abstract syntax
Higher-order abstract syntax is a central representation technique in logical frameworks which maps variables of the object… (More)
  • figure 1
  • figure 2
Is this relevant?
1997
1997
A Logic for Reasoning with Higher-Order Abstract Syntax
Logical frameworks based on intuitionistic or linear logics with higher-type quantification have been successfully used to give… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Higher-Order Abstract Syntax in Coq
The terms of the simply-typed-calculus can be used to express the higher-order abstract syntax of objects such as logical… (More)
Is this relevant?
1994
1994
Higher-Order Abstract Syntax with Induction in Coq
Three important properties of Higher-Order Abstract Syntax are the (higher-order) induction principle, which allows proofs by… (More)
Is this relevant?