Results 41 to 50 of about 341,662 (337)
Generic conversions of abstract syntax representations [PDF]
Proceedings of the 8th ACM SIGPLAN workshop on Generic programming, 2012 In this paper we present a datatype-generic approach to syntax with variable binding. A universe specifies the binding and scoping structure of object languages, including binders that bind multiple variables as well as sequential and recursive scoping.
Keuchel, Steven, Jeuring, Johan T.
openaire +6 more sources
Abstract Syntax: Substitution and Binders [PDF]
Electronic Notes in Theoretical Computer Science, 2007 We summarise Fiore et al's paper on variable substitution and binding, then axiomatise it. Generalising their use of the category F of finite sets to model untyped cartesian contexts, we let S be an arbitrary pseudo-monad on Cat and consider (S1)^o^p: this generality includes linear contexts, affine contexts, and contexts for the Logic of Bunched ...
openaire +2 more sources
, 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 +4 more sources
Deep Learning With Customized Abstract Syntax Tree for Bug Localization
IEEE Access, 2019 Given a bug report, bug localization technique can help developers automatically locate potential buggy files. Information retrieval and deep learning approaches have been applied in bug localization by extracting lexical features in bug reports and ...
Hongliang Liang +3 more
doaj +1 more source
A Corpus-based Toy Model for DisCoCat [PDF]
, 2016 The categorical compositional distributional (DisCoCat) model of meaning rigorously connects distributional semantics and pregroup grammars, and has found a variety of applications in computational linguistics.
Gogioso, Stefano
core +2 more sources
An Abstract Syntax Tree Encoding Method for Cross-Project Defect Prediction
IEEE Access, 2019 In the last few years, with the development of deep learning theory, researchers have tried to introduce the method of artificial intelligence into the field of software defect prediction (SDP) to improve its prediction effect.
Ziyi Cai, Lu Lu, Shaojian Qiu
doaj +1 more source
Integrated Definition of Abstract and Concrete Syntax for Textual Languages [PDF]
Proceedings of the ACM/IEEE 10th International Conference on Model
Driven Engineering Languages and Systems (MODELS 2007), Nashville, TN, USA,
LNCS 4735, 2014 An understandable concrete syntax and a comprehensible abstract syntax are two central aspects of defining a modeling language. Both representations of a language significantly overlap in their structure and also information, but may also differ in parts of the information.
arxiv +1 more source
Initial Algebra Semantics for Cyclic Sharing Tree Structures [PDF]
, 2010 Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised reasoning with useful principles such as structural induction and ...
Hamana, Makoto
core +1 more source
arXiv, 2022 This article explores a generic framework of well-typed and well-scoped syntaxes, with a signature-axiom approach resembling traditional abstract algebra. The boilerplate code needed in defining operations on syntaxes is identified and abstracted away. Some of the frequent boilerplate proofs are also generalized.
arxiv
Parametric Compositional Data Types [PDF]
, 2012 In previous work we have illustrated the benefits that compositional data types (CDTs) offer for implementing languages and in general for dealing with abstract syntax trees (ASTs).
Bahr, Patrick, Hvitved, Tom
core +3 more sources