The Experts below are selected from a list of 177 Experts worldwide ranked by ideXlab platform
Eelco Visser - One of the best experts on this subject based on the ideXlab platform.
-
SLE - Interactive disambiguation of meta programs with Concrete Object syntax
Software Language Engineering, 2011Co-Authors: Lennart C. L. Kats, Karl Trygve Kalleberg, Eelco VisserAbstract:In meta-programming with Concrete Object syntax, meta programs can be written using the Concrete syntax of manipulated programs. Quotations of Concrete syntax fragments and anti-quotations for meta-level expressions and variables are used to manipulate the abstract representation of programs. These small, isolated fragments are often ambiguous and must be explicitly disambiguated with quotation tags or types, using names from the non-terminals of the Object language syntax. Discoverability of these names has been an open issue, as they depend on the (grammar) implementation and are not part of the Concrete syntax of a language. Based on advances in interactive development environments, we introduce interactive disambiguation to address this issue, providing real-time feedback and proposing quick fixes in case of ambiguities.
-
Interactive disambiguation of meta programs with Concrete Object syntax
2010Co-Authors: C.l. Kats, Karl Trygve Kalleberg, Eelco VisserAbstract:In meta-programming with Concrete Object syntax, meta programs can be written using the Concrete syntax of manipulated programs. Quotations of Concrete syntax fragments and anti-quotations for meta-level expressions and variables are used to manipulate the abstract representation of programs. These small, isolated fragments are often ambiguous and must be explicitly disambiguated with quotation tags or types, using names from the non-terminals of the Object language syntax. Discoverability of these names has been an open issue, as they depend on the (grammar) implementation and are not part of the Concrete syntax of a language. Based on advances in interactive development environments, we introduce interactive disambiguation to address this issue, providing real-time feedback and proposing quick fixes in case of ambiguities This paper is a pre-print of: Proceedings of the 3rd International Conference of Software Language Engineering (SLE 2010), Eindhoven (The Netherlands) 12-13 Oct. 2010, Lecture Notes in Computer Science, Springer, 2010
-
interactive disambiguation of meta programs with Concrete Object syntax
Software Language Engineering, 2010Co-Authors: Lennart C. L. Kats, Karl Trygve Kalleberg, Eelco VisserAbstract:In meta-programming with Concrete Object syntax, meta programs can be written using the Concrete syntax of manipulated programs. Quotations of Concrete syntax fragments and anti-quotations for meta-level expressions and variables are used to manipulate the abstract representation of programs. These small, isolated fragments are often ambiguous and must be explicitly disambiguated with quotation tags or types, using names from the non-terminals of the Object language syntax. Discoverability of these names has been an open issue, as they depend on the (grammar) implementation and are not part of the Concrete syntax of a language. Based on advances in interactive development environments, we introduce interactive disambiguation to address this issue, providing real-time feedback and proposing quick fixes in case of ambiguities.
-
generalized type based disambiguation of meta programs with Concrete Object syntax
Generative Programming and Component Engineering, 2005Co-Authors: Martin Bravenboer, Rob Vermaas, Jurgen Vinju, Eelco VisserAbstract:In meta programming with Concrete Object syntax, Object-level programs are composed from fragments written in Concrete syntax. The use of small program fragments in such quotations and the use of meta-level expressions within these fragments (anti-quotation) often leads to ambiguities. This problem is usually solved through explicit disambiguation, resulting in considerable syntactic overhead. A few systems manage to reduce this overhead by using type information during parsing. Since this is hard to achieve with traditional parsing technology, these systems provide specific combinations of meta and Object languages, and their implementations are difficult to reuse. In this paper, we generalize these approaches and present a language independent method for introducing Concrete Object syntax without explicit disambiguation. The method uses scannerless generalized-LR parsing to parse meta programs with embedded Object-level fragments, which produces a forest of all possible parses. This forest is reduced to a tree by a disambiguating type checker for the meta language. To validate our method we have developed embeddings of several Object languages in Java, including AspectJ and Java itself.
-
GPCE - Generalized type-based disambiguation of meta programs with Concrete Object syntax
Generative Programming and Component Engineering, 2005Co-Authors: Martin Bravenboer, Rob Vermaas, Jurgen Vinju, Eelco VisserAbstract:In meta programming with Concrete Object syntax, Object-level programs are composed from fragments written in Concrete syntax. The use of small program fragments in such quotations and the use of meta-level expressions within these fragments (anti-quotation) often leads to ambiguities. This problem is usually solved through explicit disambiguation, resulting in considerable syntactic overhead. A few systems manage to reduce this overhead by using type information during parsing. Since this is hard to achieve with traditional parsing technology, these systems provide specific combinations of meta and Object languages, and their implementations are difficult to reuse. In this paper, we generalize these approaches and present a language independent method for introducing Concrete Object syntax without explicit disambiguation. The method uses scannerless generalized-LR parsing to parse meta programs with embedded Object-level fragments, which produces a forest of all possible parses. This forest is reduced to a tree by a disambiguating type checker for the meta language. To validate our method we have developed embeddings of several Object languages in Java, including AspectJ and Java itself.
Jurgen Vinju - One of the best experts on this subject based on the ideXlab platform.
-
RISE - Type-driven automatic quotation of Concrete Object code in meta programs
Rapid Integration of Software Engineering Techniques, 2006Co-Authors: Jurgen VinjuAbstract:Meta programming can be facilitated by the ability to represent program fragments in Concrete syntax instead of abstract syntax. The resulting meta programs are more self-documenting. One caveat in Concrete meta programming is the syntactic separation between the meta language and the Object language. To solve this problem, many meta programming systems use quoting and anti-quoting to indicate precisely where level switches occur. These “syntactic hedges” can obfuscate the Concrete program fragments. This paper describes an algorithm for inferring quotes, such that the meta programmer no longer needs to explicitly indicate transitions between the meta and Object languages.
-
generalized type based disambiguation of meta programs with Concrete Object syntax
Generative Programming and Component Engineering, 2005Co-Authors: Martin Bravenboer, Rob Vermaas, Jurgen Vinju, Eelco VisserAbstract:In meta programming with Concrete Object syntax, Object-level programs are composed from fragments written in Concrete syntax. The use of small program fragments in such quotations and the use of meta-level expressions within these fragments (anti-quotation) often leads to ambiguities. This problem is usually solved through explicit disambiguation, resulting in considerable syntactic overhead. A few systems manage to reduce this overhead by using type information during parsing. Since this is hard to achieve with traditional parsing technology, these systems provide specific combinations of meta and Object languages, and their implementations are difficult to reuse. In this paper, we generalize these approaches and present a language independent method for introducing Concrete Object syntax without explicit disambiguation. The method uses scannerless generalized-LR parsing to parse meta programs with embedded Object-level fragments, which produces a forest of all possible parses. This forest is reduced to a tree by a disambiguating type checker for the meta language. To validate our method we have developed embeddings of several Object languages in Java, including AspectJ and Java itself.
-
type driven automatic quotation of Concrete Object code in meta programs
Lecture Notes in Computer Science, 2005Co-Authors: Jurgen VinjuAbstract:Meta programming can be facilitated by the ability to represent program fragments in Concrete syntax instead of abstract syntax. The resulting meta programs are more self-documenting. One caveat in Concrete meta programming is the syntactic separation between the meta language and the Object language. To solve this problem, many meta programming systems use quoting and anti-quoting to indicate precisely where level switches occur. These “syntactic hedges” can obfuscate the Concrete program fragments. This paper describes an algorithm for inferring quotes, such that the meta programmer no longer needs to explicitly indicate transitions between the meta and Object languages.
-
GPCE - Generalized type-based disambiguation of meta programs with Concrete Object syntax
Generative Programming and Component Engineering, 2005Co-Authors: Martin Bravenboer, Rob Vermaas, Jurgen Vinju, Eelco VisserAbstract:In meta programming with Concrete Object syntax, Object-level programs are composed from fragments written in Concrete syntax. The use of small program fragments in such quotations and the use of meta-level expressions within these fragments (anti-quotation) often leads to ambiguities. This problem is usually solved through explicit disambiguation, resulting in considerable syntactic overhead. A few systems manage to reduce this overhead by using type information during parsing. Since this is hard to achieve with traditional parsing technology, these systems provide specific combinations of meta and Object languages, and their implementations are difficult to reuse. In this paper, we generalize these approaches and present a language independent method for introducing Concrete Object syntax without explicit disambiguation. The method uses scannerless generalized-LR parsing to parse meta programs with embedded Object-level fragments, which produces a forest of all possible parses. This forest is reduced to a tree by a disambiguating type checker for the meta language. To validate our method we have developed embeddings of several Object languages in Java, including AspectJ and Java itself.
Alex Steinberg - One of the best experts on this subject based on the ideXlab platform.
-
Priority monism and part/whole dependence
Philosophical Studies, 2014Co-Authors: Alex SteinbergAbstract:Priority monism is the view that the cosmos is the only independent Concrete Object. The paper argues that, pace its proponents, Priority monism is in conflict with the dependence of any whole on any of its parts: if the cosmos does not depend on its parts, neither does any smaller composite.
Claudio Calosi - One of the best experts on this subject based on the ideXlab platform.
-
Priority monism, dependence and fundamentality
Philosophical Studies, 2018Co-Authors: Claudio CalosiAbstract:Priority monism (PM) is roughly the view that the universe is the only fundamental Object, that is, a Concrete Object that does not depend on any other Concrete Object. Schaffer, the main advocate of PM, claims that PM is compatible with dependence having two different directions: from parts to wholes for subcosmic wholes, and from whole to parts for the cosmic whole. Recently it has been argued that this position is untenable. Given plausible assumptions about dependence, PM entails that dependence has only one direction, it always goes from wholes to parts. One such plausible assumption is a principle of Isolation. I argue that, given all extant accounts of dependence on the market, PM entails No Isolation. The argument depends upon a particular feature of the dependence relation, namely, necessitation and its direction. In the light of this, I contend that the argument is important, insofar as it suggests that we should distinguish dependence from other cognate notions, e.g. grounding. Once this distinction is made, I suggest we should also distinguish between two different notions of fundamentality that might turn out to be not-coextensive.
Wolfgang Spohn - One of the best experts on this subject based on the ideXlab platform.
-
Three kinds of worlds and two kinds of truth
Philosophical Studies, 2015Co-Authors: Wolfgang SpohnAbstract:This paper argues for three kinds of possible worlds: Wittgensteinian totalities of facts, Lewisian worlds or universes, Concrete Objects of maximal essence, and the world, a Concrete Object of minimal essence. It moreover explains that correspondence truth applies to Wittgensteinian totalities and pragmatic truth to Lewisian universes. And it finally argues that this conceptualization lays proper foundations to two-dimensional semantics.