Results 1 to 10 of about 341,662 (337)
Extended Initiality for Typed Abstract Syntax [PDF]
Logical Methods in Computer Science, 2012 Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of 'models', yielding induction and recursion principles for abstract syntax.
André Hirschowitz and Marco Maggesi +5 more
core +9 more sources
Canonical Abstract Syntax Trees [PDF]
Electronic Notes in Theoretical Computer Science, 2006 This paper presents Gom, a language for describing abstract syntax trees and generating a Java implementation for those trees. Gom includes features allowing the user to specify and modify the interface of the data structure.
Reilles, Antoine
core +11 more sources
An abstract view on syntax with sharing [PDF]
Journal of Logic and Computation, 2011 The notion of term graph encodes a refinement of inductively generated syntax in which regard is paid to the the sharing and discard of subterms.
Garner, Richard
core +3 more sources
Abstract clones for abstract syntax [PDF]
, 2021 To appear in the proceedings of FSCD 2021; 16 ...
Arkor, Nathanael, McDermott, Dylan
openaire +6 more sources
Relating Nominal and Higher-order Abstract Syntax Specifications [PDF]
arXiv, 2010 Nominal abstract syntax and higher-order abstract syntax provide a means for describing binding structure which is higher-level than traditional techniques.
Gacek, Andrew
core +3 more sources
Syntax without Abstract Objects [PDF]
, 2011 In line with the nominalistic denial of the existence of abstract objects, a basic theory of syntax for formal languages is developed and shown to satisfy certain fundamental ...
Kozian, Ralf
core +4 more sources
Nested Abstract Syntax in Coq [PDF]
Journal of Automated Reasoning, 2010 We illustrate Nested Abstract Syntax as a high-level alternative representation of langages with binding constructs, based on nested datatypes. Our running example is a partial solution in the Coq proof assistant to the POPLmark Challenge. The resulting formalization is very compact and does not require any extra library or special logical apparatus ...
MAGGESI, MARCO, Hirschowitz, André
openaire +3 more sources
Type-Directed Program Transformations for the Working Functional Programmer [PDF]
, 2020 We present preliminary research on Deuce+, a set of tools integrating plain text editing with structural manipulation that brings the power of expressive and extensible type-directed program transformations to everyday, working programmers without a ...
Chugh, Ravi, Lubin, Justin
core +1 more source
Higher-order abstract syntax [PDF]
Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation, 1988 We describe motivation, design, use, and implementation of higher-order abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or unification are central operations.
Conal Elliott, Frank Pfenning
openaire +2 more sources
Formal metatheory of second-order abstract syntax [PDF]
Proceedings of the ACM on Programming Languages, 2022 Despite extensive research both on the theoretical and practical fronts, formalising, reasoning about, and implementing languages with variable binding is still a daunting endeavour – repetitive boilerplate and the overly complicated metatheory of capture-avoiding substitution often get in the way of progressing on to the actually interesting ...
Fiore, Marcelo, Szamozvancev, Dmitrij
openaire +2 more sources