Results 261 to 270 of about 18,484 (310)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM SIGACT News, 2006
A recent SIGACT News Logic column, guest-written by James Cheney DOI = 10.1145/1107523.1107537 , discussed nominal logic [1], an approach to abstract syntax with binding structure. In addition to providing a worthy tutorial on nominal logic, that column leveled five criticisms at higher-order abstract syntax, an ...
Karl Crary, Robert Harper
openaire +1 more source
A recent SIGACT News Logic column, guest-written by James Cheney DOI = 10.1145/1107523.1107537 , discussed nominal logic [1], an approach to abstract syntax with binding structure. In addition to providing a worthy tutorial on nominal logic, that column leveled five criticisms at higher-order abstract syntax, an ...
Karl Crary, Robert Harper
openaire +1 more source
2013
The theory of abstract interpretation is a conceptual framework for reasoning about approximation of semantics. We ask if the creative process of designing an approximation can be studied mathematically. Semantic approximations, whether studied in a purely mathematical setting, or implemented in a static analyser, must have a representation.
Vijay D’Silva, Daniel Kroening
openaire +2 more sources
The theory of abstract interpretation is a conceptual framework for reasoning about approximation of semantics. We ask if the creative process of designing an approximation can be studied mathematically. Semantic approximations, whether studied in a purely mathematical setting, or implemented in a static analyser, must have a representation.
Vijay D’Silva, Daniel Kroening
openaire +2 more sources
Combining higher-order abstract syntax with first-order abstract syntax in ATS
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding, 2005Encodings based on higher-order abstract syntax represent the variables of an object-language as the variables of a meta-language. Such encodings allow for the reuse of α-conversion, substitution and hypothetical judgments already defined in the meta-language and thus often lead to simple and natural formalization.
Kevin Donnelly, Hongwei Xi
openaire +1 more source
Unified Syntax for Abstract State Machines
2016The paper presents our efforts in defining UASM, a unified syntax for Abstract State Machines ASMs, based on the syntaxes of two of the main ASM frameworks, CoreASM and ASMETA, which have been adapted to accept UASM as input syntax of all their validation and verification tools.
Arcaini, Paolo +8 more
openaire +3 more sources
From Concrete Syntax to Abstract Syntax
2012Until now, we have written programs in abstract syntax, which is convenient when handling programs as data.
openaire +1 more source
Abstractness and Generative Syntax
Studies in Hispanic and Lusophone Linguistics, 2009Abstract In the field of generative syntax, abstractness has a crucial role in how the field is defined and in how it is practiced. This article discusses four ways in which abstractness is essential to progress in the field. First, abstractness is crucial to the formulation of grammars of individual languages.
openaire +1 more source
Abstract syntax and variable binding
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 2003We develop a theory of abstract syntax with variable binding. To every binding signature we associate a category of models consisting of variable sets endowed with compatible algebra and substitution structures. The syntax generated by the signature is the initial model. This gives a notion of initial algebra semantics encompassing the traditional one;
M. Fiore, G. Plotkin, D. Turi
openaire +1 more source

