Filters








10,735 Hits in 5.9 sec

Cancellation in context-free languages: enrichment by reduction

M Jantzen, H Petersen
1994 Theoretical Computer Science  
Petersen, Cancellation in context-free languages: enrichment by reduction, Theoretical Computer Science 127 (1994) 1499170.  ...  In this paper we will investigate another approach: a context-free language is modified by a reduction xX-+;_ In fact, the iterated application of this reduction reduces the well known semi-Dyck set 0'  ...  In [14] it was shown for the first time that terminal Petri net languages can be obtained by Dycki-reductions from the context-free languages, i.e. L c Cf"/ 0':.  ... 
doi:10.1016/0304-3975(94)90104-x fatcat:oddjbkup5ze23ewt3udgibxj44

Multi-Level Languages are Generalized Arrows [article]

Adam Megacz
2011 arXiv   pre-print
Combined with the existence of a particular kind of retraction in the host language, this proof can be used to define an invertible translation from two-level terms to one-level terms parameterized by  ...  This restriction is also present in multi-level languages which offer unlimited cross-level persistence.  ...  free variables.  ... 
arXiv:1007.2885v2 fatcat:yz276ixckrddfgmayutifsrkie

Higher-Order Operator Precedence Languages

Stefano Crespi Reghizzi, Matteo Pradella
2017 Electronic Proceedings in Theoretical Computer Science  
We show that such languages are defined by a simple cancellation rule and we prove several properties, in particular that max-languages make an infinite hierarchy ordered by parameter k.  ...  The new corresponding class of Higher-order Operator Precedence languages (HOP) properly includes the OP languages, and it is still included in the deterministic (also in reverse) context free family.  ...  is context-free but not necessarily regular, and is called maximal language or max-language.  ... 
doi:10.4204/eptcs.252.11 fatcat:xlbvvp4k5fb3njoa7vyrwifviy

Environmental bisimulations for higher-order languages

Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
2011 ACM Transactions on Programming Languages and Systems  
Developing a theory of bisimulation in higher-order languages can be hard.  ...  to languages with different features.  ...  We are grateful to Vassileios Koutavas: discussions with him in the initial development of this work were helpful in clarifying concepts. We would like also to thank Kohei Suenaga for comments.  ... 
doi:10.1145/1889997.1890002 fatcat:6ca7e3evqvbg7enfp4i7hgjvxi

Environmental Bisimulations for Higher-Order Languages

Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
2007 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)  
Developing a theory of bisimulation in higher-order languages can be hard.  ...  to languages with different features.  ...  We are grateful to Vassileios Koutavas: discussions with him in the initial development of this work were helpful in clarifying concepts. We would like also to thank Kohei Suenaga for comments.  ... 
doi:10.1109/lics.2007.17 dblp:conf/lics/SangiorgiKS07 fatcat:qgphe3yllrcj5g67z5d7gyykyi

The Scribble Protocol Language [chapter]

Nobuko Yoshida, Raymond Hu, Rumyana Neykova, Nicholas Ng
2014 Lecture Notes in Computer Science  
The work has been partially sponsored by the Ocean Observatories Initiative, VMware, EP-SRC KTS under Cognizant, and EPSRC EP/K011715/1, EP/K034413/1 and EP/G015635/1.  ...  Our central philosophy in designing Scribble, as a high-level language for describing communication-centred applications, is to enable description which is free from implementation details but which allows  ...  Figure 6 gives a very simple revision of the ServiceCall protocol that allows the Client to cancel the call by interrupting the Server's reply.  ... 
doi:10.1007/978-3-319-05119-2_3 fatcat:6czxti2ptzeoxpmtw6dzp7xspe

The Scribble Protocol Language [chapter]

Nobuko Yoshida, Raymond Hu, Rumyana Neykova, Nicholas Ng
2014 Lecture Notes in Computer Science  
The work has been partially sponsored by the Ocean Observatories Initiative, VMware, EP-SRC KTS under Cognizant, and EPSRC EP/K011715/1, EP/K034413/1 and EP/G015635/1.  ...  Our central philosophy in designing Scribble, as a high-level language for describing communication-centred applications, is to enable description which is free from implementation details but which allows  ...  Figure 6 gives a very simple revision of the ServiceCall protocol that allows the Client to cancel the call by interrupting the Server's reply.  ... 
doi:10.1007/978-3-319-14128-2_3 fatcat:r2nsvqeegjaplizemlnees3eue

Operational semantics for multi-language programs

Jacob Matthews, Robert Bruce Findler
2009 ACM Transactions on Programming Languages and Systems  
While we present our results in an abstract setting, they shed light on real multi-language systems and tools such as the JNI, SWIG, and Haskell's stable pointers.  ...  In this paper, we take first steps toward higher-level models of interoperating systems.  ...  This work was funded in part by the National Science Foundation.  ... 
doi:10.1145/1498926.1498930 fatcat:q5nwbdqckfdd5er2ju4euvpthm

Operational semantics for multi-language programs

Jacob Matthews, Robert Bruce Findler
2007 Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '07  
While we present our results in an abstract setting, they shed light on real multi-language systems and tools such as the JNI, SWIG, and Haskell's stable pointers.  ...  In this paper, we take first steps toward higher-level models of interoperating systems.  ...  This work was funded in part by the National Science Foundation.  ... 
doi:10.1145/1190216.1190220 dblp:conf/popl/MatthewsF07 fatcat:uvwtkoumyjee3fw4xbd3zptewy

Operational semantics for multi-language programs

Jacob Matthews, Robert Bruce Findler
2007 SIGPLAN notices  
While we present our results in an abstract setting, they shed light on real multi-language systems and tools such as the JNI, SWIG, and Haskell's stable pointers.  ...  In this paper, we take first steps toward higher-level models of interoperating systems.  ...  This work was funded in part by the National Science Foundation.  ... 
doi:10.1145/1190215.1190220 fatcat:hzzxvn6sqreynpqgkhx6hvbbaq

Chomsky-Schützenberger parsing for weighted multiple context-free languages

Tobias Denkinger
2017 Journal of Language Modelling  
We prove a Chomsky-Schützenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids.  ...  Using this representation we devise a parsing algorithm for a restricted form of those devices. 1 1 introduction Mildly context-sensitive languages receive much attention in the natural language processing  ...  Multiple context-free grammars describe the language classes induced by many mildly context-sensitive grammar formalisms, e.g. head grammars (Seki et al. 1991) , linear context-free rewriting systems  ... 
doi:10.15398/jlm.v5i1.159 fatcat:a2h5hh6t4vaphmeijir6nvnaba

Elements of style of BPMN language [article]

Anacleto Correia
2016 arXiv   pre-print
Instead, the rules regarding BPMN elements are only informally specified in natural language throughout the overall BPMN documentation.  ...  To mitigate this problem, and therefore contribute for achieving BPMN models' correctness, we propose to supplement the BPMN metamodel with well-formedness rules expressed by OCL invariants.  ...  There are several approaches, from different fields, which have been used in studies (e.g. comparison and analysis) about modeling languages in general, and business process modeling languages in particular  ... 
arXiv:1502.06297v2 fatcat:2feqjegb2bebbnlulg6ggxzg7y

Language teaching

2003 Language Teaching  
In addition, all subjects interpreted the plausibility of the filler-gap dependency, as shown by a reduction in the garden path effect when the initial analysis was implausible.  ...  Dependent variables were free recall of the target words in Spanish, free recall of the target words in English, and cued recall (generate Spanish words when presented with pictures).  ...  It concludes among other things that in the area under investigation the German language − judged by quantitative criteria − still has a firm position and is enjoying a remarkable boom.  ... 
doi:10.1017/s0261444802211891 fatcat:iftz5xcuvnexrgjaebz7o2gvva

Language testing

2003 Language Teaching  
In addition, all subjects interpreted the plausibility of the filler-gap dependency, as shown by a reduction in the garden path effect when the initial analysis was implausible.  ...  Dependent variables were free recall of the target words in Spanish, free recall of the target words in English, and cued recall (generate Spanish words when presented with pictures).  ...  It concludes among other things that in the area under investigation the German language − judged by quantitative criteria − still has a firm position and is enjoying a remarkable boom.  ... 
doi:10.1017/s0261444802241890 fatcat:lqbwrdvovbhkdmhehuec6qcsja

Super-Languages: Developing Languages and Applications with XMF (Second Edition) [article]

Tony Clark, Paul Sammut, James Willans
2015 arXiv   pre-print
This is done by defining the language, providing some examples of applications that can be written directly in the XOCL language that comes with XMF, and then by showing how XMF can be used for language  ...  The main focus of this book is on language engineering by example.  ...  The reduction is shown in figure 21.2.  ... 
arXiv:1506.03363v1 fatcat:57y27eubjzcujm4tqf37olfjca
« Previous Showing results 1 — 15 out of 10,735 results