Results 11 to 20 of about 341,662 (337)
Abstract Syntax Networks for Code Generation and Semantic Parsing [PDF]
arXiv, 2017 Tasks like code generation and semantic parsing require mapping unstructured (or partially structured) inputs to well-formed, executable outputs. We introduce abstract syntax networks, a modeling framework for these problems.
Klein, Dan +2 more
core +4 more sources
Constraint solving in non-permutative nominal abstract syntax [PDF]
Logical Methods in Computer Science, 2011 Nominal abstract syntax is a popular first-order technique for encoding, and reasoning about, abstract syntax involving binders. Many of its applications involve constraint solving.
Matthew R. Lakin
doaj +2 more sources
Logic Column 14: Nominal Logic and Abstract Syntax [PDF]
SIGACT News 36 (4), pp. 47-69, 2005, 2005 Formalizing syntactic proofs of properties of logics, programming languages, security protocols, and other formal systems is a significant challenge, in large part because of the obligation to handle name-binding correctly. We present an approach called nominal abstract syntax that has attracted considerable interest since its introduction ...
James Cheney
arxiv +3 more sources
An EMOF-Compliant Abstract Syntax for Bigraphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 In Proceedings GaM 2016, arXiv:1612 ...
Christos Tsigkanos +2 more
openaire +6 more sources
A DSL for Mapping Abstract Syntax Models to Concrete Syntax Models in ModelCC [PDF]
arXiv, 2013 ModelCC is a model-based parser generator that decouples language design from language processing. ModelCC provides two different mechanisms to specify the mapping from an abstract syntax model to a concrete syntax model: metadata annotations defined on top of the abstract syntax model specification and a domain-specific language for defining ASM-CSM ...
Luis Quesada +2 more
arxiv +3 more sources
Normalization by Evaluation with Typed Abstract Syntax [PDF]
BRICS Report Series, 2001 <p>We present a simple way to implement typed abstract syntax for the<br />lambda calculus in Haskell, using phantom types, and we specify <br />normalization by evaluation (i.e., type-directed partial evaluation) to yield this<br />typed abstract syntax.
Danvy, Olivier +2 more
+9 more sources
A syntax-semantics interface for Tree-Adjoining Grammars through Abstract Categorial Grammars
Journal of Language Modelling, 2018 We present a model of the syntax-semantics interface for Tree-Adjoining Grammars (TAGs). It is based on the encoding of TAGs within the framework of Abstract Categorial Grammars (ACGs).
Sylvain Pogodalla
doaj +3 more sources
Variable binding, symmetric monoidal closed theories, and bigraphs [PDF]
arXiv, 2009 This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects.
A. Barber +16 more
core +5 more sources
A Generic Framework for Automated Quality Assurance of Software Models –Implementation of an Abstract Syntax Tree [PDF]
, 2014 —Abstract Syntax Tree’s (AST) are used in language tools, such as compilers, language translators and transformers as well as analysers; to remove syntax and are therefore an ideal construct for a language independent tool.
Anderson, Mark, Owens, Darryl
core +4 more sources
The ModelCC Model-Driven Parser Generator [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Syntax-directed translation tools require the specification of a language by means of a formal grammar. This grammar must conform to the specific requirements of the parser generator to be used.
Berzal, Fernando +3 more
core +3 more sources