Add to ORKGthis paper appears as [7]. Alan Mycroft & Mads Rosendahl the instrumentation was appropriate. We sidestep this issue by showing that, with a slight modification, the minimal function graph semantics can be defined in terms of the standard semantics. We also show that there are two subtly different MFG semantics according to how the definition of reachability is interpreted --- either as strictness or as neededness. 1. First-order Languag
Minimal Type Theory (MTT) shows exactly how all of the constituent parts of an expression relate to ...
Abstract. Explicitly enforcing strictness is often used by functional pro-grammers as an important t...
In this paper I argue that both parametric variation and the alleged differences between languages i...
Abstract. We present a minimal function graph semantics for a higher-order functional language with ...
In this introductory paper the editors develop arguments in favor of the idea that what appears as r...
The type of a minimalist grammar (MG) as introduced by Stabler [12] provides an attempt of a rigoro...
AbstractA graph languageLis in the class C-edNCE of context-free edNCE graph languages if and only i...
In this paper we develop an algorithm, based on abstract interpretation, for source specialisation o...
We define the notion of a graph anew without using the available Mizar structures. In our approach, ...
The purpose of this paper is to show that we can work in the spirit of minimalist grammars by means ...
Abstract. Minimalist grammars are a mildly context-sensitive gram-mar framework within which analyse...
Michaelis J. On Formal Properties of Minimalist Grammars. Linguistics in Potsdam. Vol 13. Potsdam: U...
We identify a set of programming constructs ensuring that a programming language based on graph tra...
This article argues that the theoretical desiderata of Minimalist Program (MP) will actually necessi...
International audienceWe investigate the decidability and complexity status of model-checking proble...
Minimal Type Theory (MTT) shows exactly how all of the constituent parts of an expression relate to ...
Abstract. Explicitly enforcing strictness is often used by functional pro-grammers as an important t...
In this paper I argue that both parametric variation and the alleged differences between languages i...
Abstract. We present a minimal function graph semantics for a higher-order functional language with ...
In this introductory paper the editors develop arguments in favor of the idea that what appears as r...
The type of a minimalist grammar (MG) as introduced by Stabler [12] provides an attempt of a rigoro...
AbstractA graph languageLis in the class C-edNCE of context-free edNCE graph languages if and only i...
In this paper we develop an algorithm, based on abstract interpretation, for source specialisation o...
We define the notion of a graph anew without using the available Mizar structures. In our approach, ...
The purpose of this paper is to show that we can work in the spirit of minimalist grammars by means ...
Abstract. Minimalist grammars are a mildly context-sensitive gram-mar framework within which analyse...
Michaelis J. On Formal Properties of Minimalist Grammars. Linguistics in Potsdam. Vol 13. Potsdam: U...
We identify a set of programming constructs ensuring that a programming language based on graph tra...
This article argues that the theoretical desiderata of Minimalist Program (MP) will actually necessi...
International audienceWe investigate the decidability and complexity status of model-checking proble...
Minimal Type Theory (MTT) shows exactly how all of the constituent parts of an expression relate to ...
Abstract. Explicitly enforcing strictness is often used by functional pro-grammers as an important t...
In this paper I argue that both parametric variation and the alleged differences between languages i...