Programming Languages

Syntax The abstract syntax of FJ is given by the following grammar: Classes C : := class c extends c′ {c f; k d} Constructors k : := c(c x) {super(x); this.f=x;} Methods d : := c m(c x) {return e;} Types τ : := c Expressions e : := x | e.f | e.m(e) | new c(e) | (c) e Underlining indicates “one or more”. If e appears in an inference rule and ei does too, there is an implicit understandng that ei is one of the e’s in e. And similarly with other underlined constructs.

[1]  Manish Parashar,et al.  Advanced Computational Infrastructures for Parallel and Distributed Adaptive Applications , 2009 .

[2]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[3]  Peter D. Mosses,et al.  Modular Bisimulation Theory for Computations and Values , 2013, FoSSaCS.

[4]  Jurriaan Rot,et al.  Presenting Distributive Laws , 2013, CALCO.

[5]  Bartek Klin.  Adding recursive constructs to bialgebraic semantics , 2004, J. Log. Algebraic Methods Program..

[6]  Thomas Johnsson,et al.  Attribute grammars as a functional programming paradigm , 1987, FPCA.

[7]  S. Doaitse Swierstra,et al.  First-class Attribute Grammars , 2000, Informatica.

[8]  Mohammad Reza Mousavi,et al.  Robustness of Equations Under Operational Extensions , 2010, EXPRESS.

[9]  Arend Rensink.  Bisimilarity of open terms , 1997, EXPRESS.

[10]  Graham Hutton,et al.  Modularity and Implementation of Mathematical Operational Semantics , 2011, Electron. Notes Theor. Comput. Sci..

[11]  John Power,et al.  Category theory for operational semantics , 2004, Theor. Comput. Sci..

[12]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[13]  S. D. Swierstra,et al.  Using attribute grammars to derive efficient functional programs , 1986 .

[14]  Bartek Klin,et al.  Bialgebras for structural operational semantics: An introduction , 2011, Theor. Comput. Sci..

[15]  Peter D. Mosses.  Component-based semantics , 2009, SAVCBS '09.

[16]  S. Doaitse Swierstra,et al.  Attribute grammars fly first-class: how to do aspect oriented programming in Haskell , 2009, ICFP.

[17]  Peter D. Mosses,et al.  Modular structural operational semantics , 2004, J. Log. Algebraic Methods Program..

[18]  Kai Qian,et al.  Component-Oriented Programming , 2005 .

[19]  John Power,et al.  Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads , 2000, CMCS.

[20]  Johan Jeuring,et al.  Generic programming with fixed points for mutually recursive datatypes , 2009, ICFP.

[21]  Marko C. J. D. van Eekelen,et al.  Modular Bialgebraic Semantics and Algebraic Laws , 2013, SBLP.

[22]  Sjaak Smetsers,et al.  GSOS Formalized in Coq , 2013, 2013 International Symposium on Theoretical Aspects of Software Engineering.

[23]  Chet Langin,et al.  Languages and Machines: An Introduction to the Theory of Computer Science , 2007 .

[24]  Marian Bubak,et al.  Interoperability of Grid component models: GCM and CCA case study , 2007, CoreGRID.

[25]  Benjamin C. Pierce,et al.  Types and programming languages: the next generation , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[26]  Jeremy G. Siek.  General purpose languages should be metalanguages , 2010, PEPM '10.

[27]  Marcos Viera,et al.  First Class Syntax, Semantics, and Their Composition , 2013, IFL '13.