Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,286 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Abstract syntax
Abstract syntax tree
Boilerplate code
Compiler
Expand
Broader (3)
Logic programming
Programming language theory
Type theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Formalizing Adequacy: A Case Study for Higher-order Abstract Syntax
J. Cheney
,
Michael Norrish
,
René Vestergaard
Journal of automated reasoning
2012
Corpus ID: 15723458
Adequacy is an important criterion for judging whether a formalization is suitable for reasoning about the actual object of study…
Expand
2010
2010
Hybrid: reasoning with higher-order abstract syntax in coq and isabelle
A. Felty
MSFP '10
2010
Corpus ID: 15551946
We present recent work on the Hybrid system, a logical framework for specifying and reasoning about languages and deductive…
Expand
2010
2010
Higher-Order Abstract Syntax in Isabelle/HOL
Douglas J. Howe
International Conference on Interactive Theorem…
2010
Corpus ID: 29216810
Higher Order Abstract Syntax, or HOAS, is a technique for using a higher-order logic as a metalanguage for an object language…
Expand
2009
2009
Logic Colloquium 2006: Higher-order abstract syntax in type theory
Venanzio Capretta
,
A. Felty
2009
Corpus ID: 15277353
We develop a general tool to formalize and reason about languages expressed using higher-order abstract syntax in a proof-tool…
Expand
2007
2007
Simple Types in Type Theory: Deep and Shallow Encodings
François Garillot
,
Benjamin Werner
International Conference on Theorem Proving in…
2007
Corpus ID: 17205984
We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is…
Expand
2006
2006
Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
Venanzio Capretta
,
A. Felty
Types for Proofs and Programs
2006
Corpus ID: 1587543
The use of higher-order abstract syntax is an important approach for the representation of binding constructs in encodings of…
Expand
Review
2006
Review
2006
Higher-order abstract syntax: setting the record straight
Karl Crary
,
R. Harper
SIGA
2006
Corpus ID: 3264818
A recent SIGACT News Logic column, guest-written by James Cheney<a href="http://doi.acm.org/10.1145/1107523.1107537">DOI =10.1145…
Expand
2006
2006
Logic Column 16: Higher-Order Abstract Syntax: Setting the Record Straight
Karl Crary
,
R. Harper
arXiv.org
2006
Corpus ID: 39069071
This article responds to a critique of higher-order abstract syntax appearing in Logic Column 14, ``Nominal Logic and Abstract…
Expand
2003
2003
Multi-level Meta-reasoning with Higher-Order Abstract Syntax
A. Momigliano
,
Simon Ambler
Foundations of Software Science and Computation…
2003
Corpus ID: 14218320
Combining Higher Order Abstract Syntax (HOAS) and (co)- induction is well known to be problematic. In previous work [1] we have…
Expand
1999
1999
Semantical analysis of higher-order abstract syntax
M. Hoffman
1999
Corpus ID: 53880709
A choke-check valve for use as with a fluid motor to cushion the piston thereof as it approaches the end of its stroke…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE