Rascal: A DSL for SCAM
|
|
- Kerry Collins
- 6 years ago
- Views:
Transcription
1 Rascal: A DSL for SCAM Jurgen Vinju Tijs van der Storm Paul Klint Amsterdam, The Netherlands Hall of fame Bob Fuhrer Emilie Balland Arnold Lankamp Bas Basten
2 The complexity of bridging an analysis tool to a transformation tool shadows the complexity of the analyses and transformations themselves [Vinju & Cordy Dagstuhl 2005]
3 Every SCAM tool requires both analysis and transformation features
4 Refactoring Every SCAM tool requires both analysis and transformation features
5 Slicing Refactoring Every SCAM tool requires both analysis and transformation features
6 Slicing Refactoring Every SCAM tool requires both analysis and transformation features Reverse Engineering
7 Slicing Refactoring Every SCAM tool requires both analysis and transformation features Reverse Engineering Compilation
8 Restructuring Slicing Refactoring Every SCAM tool requires both analysis and transformation features Reverse Engineering Compilation
9 Restructuring Slicing Refactoring Every SCAM tool requires both analysis and transformation features Reverse Engineering Compilation Static checking
10 Most language parametric SCAM tools are geared towards either analysis or transformation
11 Most language parametric SCAM tools are geared towards either analysis or transformation TXL
12 Most language parametric SCAM tools are geared towards either analysis or transformation StrategoXT TXL
13 Crocopat Most language parametric SCAM tools are geared towards either analysis or transformation StrategoXT TXL
14 Crocopat GROK Most language parametric SCAM tools are geared towards either analysis or transformation StrategoXT TXL
15 Crocopat GROK Most language parametric SCAM tools are geared towards either analysis or transformation ASF+SDF StrategoXT TXL
16 Crocopat GROK RScript Most language parametric SCAM tools are geared towards either analysis or transformation ASF+SDF StrategoXT TXL
17 Many great SCAM tools are implemented in a GPL
18 Many great SCAM tools are implemented in a GPL A GPL allows fine-grained integration between analysis and transformation
19 Many great SCAM tools are implemented in a GPL A GPL allows fine-grained integration between analysis and transformation
20 A DSL for SCAM? That covers SCAM That scales down and scales up That is easier
21 The SCAM domain Transformation Source Code Extraction Generation Analysis Models Visualization Formalization Pictures Conversion
22 The SCAM domain Transformation Source Code Uses common... Data-structures Extraction Generation Algorithms Analysis Models Nothing new! But still.. Synthesize into a DSL Visualization Formalization Conceptually Pictures Conversion Syntactically Semantically
23 The SCAM domain Transformation Source Code Uses common... Data-structures Extraction Generation Algorithms Analysis Models Nothing new! But still.. Pattern Synthesize into a DSL Matching Visualization Formalization Conceptually Pictures Conversion Syntactically Semantically
24 Rascal has to scale down to make simple tasks short and easy to experiment with
25 Plain old REPL, no static type errors Rascal has to scale down to make simple tasks short and easy to experiment with
26 First regexps, Plain old REPL, then CFG s no static type errors Rascal has to scale down to make simple tasks short and easy to experiment with
27 First regexps, Plain old REPL, then CFG s no static type errors Rascal has to scale down to make simple tasks short and easy to experiment with Complete & domain specific, expression language: visit, pattern matching, relational calculus
28 Plain old REPL, no static type errors First regexps, then CFG s URI literals: files, projects, SVN,... Rascal has to scale down to make simple tasks short and easy to experiment with Complete & domain specific, expression language: visit, pattern matching, relational calculus
29 Rascal has to scale up to complex analysis and transformation algorithms that employ reuse of (library) functionality and allow design for maintainability
30 Modules are statically checked Rascal has to scale up to complex analysis and transformation algorithms that employ reuse of (library) functionality and allow design for maintainability
31 Modules are statically Immutable data checked Rascal has to scale up to complex analysis and transformation algorithms that employ reuse of (library) functionality and allow design for maintainability
32 Modules are statically checked Immutable data Co-variant sub-types Rascal has to scale up to complex analysis and transformation algorithms that employ reuse of (library) functionality and allow design for maintainability
33 Modules are statically checked Immutable data Co-variant sub-types h.o. parametric polymorphism, rank-1 and 2 Rascal has to scale up to complex analysis and transformation algorithms that employ reuse of (library) functionality and allow design for maintainability
34 Modules are statically checked Immutable data Co-variant sub-types h.o. parametric polymorphism, rank-1 and 2 Rascal has to scale up to complex analysis and transformation algorithms that employ reuse of (library) functionality and allow design for maintainability Efficient and fully typed (de)serialization
35 Modules are statically checked Immutable data Co-variant sub-types h.o. parametric polymorphism, rank-1 and 2 Rascal has to scale up to complex analysis and transformation algorithms that employ reuse of (library) functionality and allow design for maintainability Efficient and fully typed Functionlocal type inference (de)serialization
36 Modules are statically checked Immutable data Co-variant sub-types h.o. parametric polymorphism, rank-1 and 2 Rascal has to scale up to complex analysis and transformation algorithms that employ reuse of (library) functionality and allow design for maintainability Efficient and fully typed (de)serialization Functionlocal type inference lexically scoped backtracking
37 Modules are statically checked Immutable data Co-variant IDE sub-types h.o. parametric polymorphism, rank-1 and 2 bla Rascal has to scale up to complex analysis and bla support bla Concrete bla transformation algorithms that employ reuse of bla (library) bla functionality and allow design for syntax maintainability Visualizatio n support Efficient and fully typed (de)serialization Functionlocal type inference lexically scoped backtracking
38 Modules are statically checked Immutable data Co-variant IDE sub-types h.o. parametric polymorphism, rank-1 and 2 bla Rascal has to scale up to complex analysis and bla support bla Concrete bla transformation algorithms that employ reuse of bla (library) bla functionality and allow design for syntax maintainability Visualizatio n support Efficient and fully typed (de)serialization Functionlocal type inference lexically scoped backtracking
39 We have implemented Infer generic type arguments [Fuhrer et al. ECOOP2005] on Generic Featherweight Java [Igarashi et al. TOPLAS2002] The size of the Rascal code is equal to the size of the formal definitions in the papers
40 Rascal Analysis and manipulation are happily married. We should think of them as one.
41 Rascal Analysis and manipulation are happily married. We should think of them as one.
EASY Programming with Rascal
EASY Programming with Rascal Paul Klint Joint work with Emilie Balland, Bas Basten, Jeroen van den Bos, Mark Hills, Arnold Lankamp, Bert Lisser, Tijs van der Storm, Jurgen Vinju Opening BLDL, November
More informationScripting a Refactoring with Rascal and Eclipse. Mark Hills, Paul Klint, & Jurgen J. Vinju
Scripting a Refactoring with Rascal and Eclipse Mark Hills, Paul Klint, & Jurgen J. Vinju Fifth Workshop on Refactoring Tools 2012 June 1, 2012 Rapperswil, Switzerland http://www.rascal-mpl.org Overview
More informationRascal Tutorial. Tijs van der Storm Wednesday, May 23, 12
Rascal Tutorial Tijs van der Storm storm@cwi.nl / @tvdstorm About me Researcher at Centrum Wiskunde & Informatica (CWI), Amsterdam, NL Co-designer of Rascal Teacher at Universiteit van Amsterdam (UvA)
More informationThe Rascal meta-programming language a lab for software analysis, transformation, generation & visualization
The Rascal meta-programming language a lab for software analysis, transformation, generation & visualization Mark Hills Anastasia Izmaylova Paul Klint Atze van der Ploeg Tijs van der Storm Jurgen Vinju
More information... is a Programming Environment (PE)?... is Generic Language Technology (GLT)?
Introduction to Generic Language Technology Today Mark van den Brand Paul Klint Jurgen Vinju Tools for software analysis and manipulation Programming language independent (parametric) The story is from
More informationThe TTC 2014 FIXML Case: Rascal Solution
The TTC 2014 FIXML Case: Rascal Solution Pablo Inostroza Tijs van der Storm Centrum Wiskunde & Informatica (CWI) Amsterdam, The Netherlands pvaldera@cwi.nl Centrum Wiskunde & Informatica (CWI) Amsterdam,
More informationThe TTC 2014 Movie Database Case: Rascal Solution
The TTC 2014 Movie Database Case: Rascal Solution Pablo Inostroza Tijs van der Storm Centrum Wiskunde & Informatica (CWI) Amsterdam, The Netherlands pvaldera@cwi.nl Centrum Wiskunde & Informatica (CWI)
More informationEASY Meta-Programming with Rascal
EASY Meta-Programming with Rascal Leveraging the Extract-Analyze-SYnthesize Paradigm Paul Klint & Jurgen Vinju Joint work with (amongst others): Bas Basten, Mark Hills, Anastasia Izmaylova, Davy Landman,
More informationUPTR - a simple parse tree representation format
UPTR - a simple parse tree representation format Jurgen Vinju Software Transformation Systems October 22, 2006 Quality of Software Transformation Systems Some Questions on Parsing Two pragmatical steps
More informationIntroducing Rascal for meta programming and Eyeballing the Cyclomatic Complexity Metric
SEN1:SWAT ATEAMS Introducing Rascal for meta programming and Eyeballing the Cyclomatic Complexity Metric Jurgen Vinju @RMOD, INRIA Lille May 11th 2012 CWI SWAT INRIA ATEAMS SoftWare Analysis and Transformation
More informationM : an Open Model for Measuring Code Artifacts
Software Analysis And Transformation 3 M : an Open Model for Measuring Code Artifacts Anastasia Izmaylova, Paul Klint, Ashim Shahi, Jurgen Vinju SWAT Centrum Wiskunde & Informatica (CWI) OSSMETER: FP7
More informationThe Rascal Approach to Code in Prose, Computed Properties, and Language Extension
The Rascal Approach to Code in Prose, Computed Properties, and Language Extension Solutions to the Language Workbench Challenge 2016 Pablo Inostroza Centrum Wiskunde & Informatica, The Netherlands pvaldera@cwi.nl
More informationThe Meta-Environment. A Language Workbench for Source code Analysis, Visualization and Transformation. Jurgen Vinju IPA herfstdagen 2008
The Meta-Environment A Language Workbench for Source code Analysis, Visualization and Transformation Jurgen Vinju IPA herfstdagen 2008 Overview Goal of The Meta-Environment Methods of The Meta-Environment
More informationRenaud Durlin. May 16, 2007
A comparison of different approaches EPITA Research and Development Laboratory (LRDE) http://www.lrde.epita.fr May 16, 2007 1 / 25 1 2 3 4 5 2 / 25 1 2 3 4 5 3 / 25 Goal Transformers:
More informationALE Agile Language Engineering
ALE Agile Language Engineering (2017 2019) Thomas Degueule CWI Inria Workshop September 19 20, 2017 CWI, Amsterdam http://gemoc.org/ale/ Context Software intensive systems CWI-Inria Workshop Agile Language
More informationScripting a Refactoring with Rascal and Eclipse
Scripting a Refactoring with Rascal and Eclipse Mark Hills Paul Klint Jurgen J. Vinju Centrum Wiskunde & Informatica, Amsterdam, The Netherlands INRIA Lille Nord Europe, Lille, France {Mark.Hills,Paul.Klint,Jurgen.Vinju@cwi.nl
More informationDomain-Specific Languages for Program Analysis
Domain-Specific Languages for Program Analysis Mark Hills OOPSLE 2015: Open and Original Problems in Software Language Engineering March 6, 2014 Montreal, Canada http://www.rascal-mpl.org 1 Overview A
More informationClosures. Mooly Sagiv. Michael Clarkson, Cornell CS 3110 Data Structures and Functional Programming
Closures Mooly Sagiv Michael Clarkson, Cornell CS 3110 Data Structures and Functional Programming Summary 1. Predictive Parsing 2. Large Step Operational Semantics (Natural) 3. Small Step Operational Semantics
More informationOrigin Tracking + Text Differencing = Textual Model Differencing
Origin Tracking + Text Differencing = Textual Model Differencing Riemer van Rozen 1(B) and Tijs van der Storm 2,3 1 Amsterdam University of Applied Sciences, Amsterdam, The Netherlands rozen@cwi.nl 2 Centrum
More informationCSCI-GA Scripting Languages
CSCI-GA.3033.003 Scripting Languages 12/02/2013 OCaml 1 Acknowledgement The material on these slides is based on notes provided by Dexter Kozen. 2 About OCaml A functional programming language All computation
More informationGrammar Composition & Extension
Grammar Composition & Extension vadim@grammarware.net Symposium on Language Composition and Modularity Vadim Zaytsev, SWAT, CWI 2012 Introduction to grammarware What is a grammar? Structural description
More informationSoftware Evolution: Conclusion, Discussion, Future Work. Dr. Vadim Zaytsev UvA, MSc SE, 7 December 2015
Software Evolution: Conclusion, Discussion, Future Work Dr. Vadim Zaytsev aka @grammarware UvA, MSc SE, 7 December 2015 Roadmap W44 Introduction V.Zaytsev W45 Metaprogramming J.Vinju W46 Reverse Engineering
More informationAbstract Syntax Sucks!
Abstract Syntax Sucks! deconstruction (?), allegory (?),... Tijs van der Storm Alfred Aho (contributed to lex) Alfred Aho (contributed to lex) Scanners suck! Jurgen Vinju Deconstruction Turn hierarchies
More informationRscript: a Relational Approach to Program and System Understanding
Rscript: a Relational Approach to Program and System Understanding Paul Klint 1 Structure of Presentation Background and context About program understanding Roadmap: Rscript 2 Background Application areas
More informationSpoofax: An Extensible, Interactive Development Environment for Program Transformation with Stratego/XT
Spoofax: An Extensible, Interactive Development Environment for Program Transformation with Stratego/XT Karl Trygve Kalleberg 1 Department of Informatics, University of Bergen, P.O. Box 7800, N-5020 BERGEN,
More information5. Semantic Analysis!
5. Semantic Analysis! Prof. O. Nierstrasz! Thanks to Jens Palsberg and Tony Hosking for their kind permission to reuse and adapt the CS132 and CS502 lecture notes.! http://www.cs.ucla.edu/~palsberg/! http://www.cs.purdue.edu/homes/hosking/!
More informationCode Transformation by Direct Transformation of ASTs
Code Transformation by Direct Transformation of ASTs M. Rizun Lviv National University of Ivan Franko, RMoD team, Inria Lille Nord Europe mrizun@gmail.com J.-C. Bach S. Ducasse RMoD team, Inria Lille Nord
More informationAn Evaluation of Domain-Specific Language Technologies for Code Generation
An Evaluation of Domain-Specific Language Technologies for Code Generation Christian Schmitt, Sebastian Kuckuk, Harald Köstler, Frank Hannig, Jürgen Teich Hardware/Software Co-Design, System Simulation,
More informationRascal: Language Technology for Model-Driven Engineering
Rascal: Language Technology for Model-Driven Engineering Jeroen van den Bos CWI & NFI jeroen@infuse.org P.R. Griffioen CWI p.r.griffioen@cwi.nl Tijs van der Storm CWI storm@cwi.nl Abstract Model-Driven
More informationGrammars and Parsing. Paul Klint. Grammars and Parsing
Paul Klint Grammars and Languages are one of the most established areas of Natural Language Processing and Computer Science 2 N. Chomsky, Aspects of the theory of syntax, 1965 3 A Language...... is a (possibly
More information1. true / false By a compiler we mean a program that translates to code that will run natively on some machine.
1. true / false By a compiler we mean a program that translates to code that will run natively on some machine. 2. true / false ML can be compiled. 3. true / false FORTRAN can reasonably be considered
More informationClosures. Mooly Sagiv. Michael Clarkson, Cornell CS 3110 Data Structures and Functional Programming
Closures Mooly Sagiv Michael Clarkson, Cornell CS 3110 Data Structures and Functional Programming t ::= x x. t t t Call-by-value big-step Operational Semantics terms variable v ::= values abstraction x.
More informationUsing Scala for building DSL s
Using Scala for building DSL s Abhijit Sharma Innovation Lab, BMC Software 1 What is a DSL? Domain Specific Language Appropriate abstraction level for domain - uses precise concepts and semantics of domain
More informationSERG. Spoofax: An Extensible, Interactive Development Environment for Program Transformation with Stratego/XT
Delft University of Technology Software Engineering Research Group Technical Report Series Spoofax: An Extensible, Interactive Development Environment for Program Transformation with Stratego/XT Karl Trygve
More informationEnabling PHP Software Engineering Research in Rascal
Enabling PHP Software Engineering Research in Rascal Mark Hills and Paul Klint WASDeTT July 1, 2013 Montpellier, France http://www.rascal-mpl.org Why look at PHP applications? 2 Why look at PHP applications?
More informationVerifiable composition of language extensions
Verifiable composition of language extensions Ted Kaminski Department of Computer Science and Engineering University of Minnesota, Minneapolis, MN, USA tedinski@cs.umn.edu Abstract. Domain-specific languages
More informationHarvard School of Engineering and Applied Sciences CS 152: Programming Languages
Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Lecture 14 Tuesday, March 24, 2015 1 Parametric polymorphism Polymorph means many forms. Polymorphism is the ability of
More informationRLSRunner: Linking Rascal with K for Program Analysis
RLSRunner: Linking Rascal with K for Program Analysis Mark Hills 1,2, Paul Klint 1,2, and Jurgen J. Vinju 1,2 1 Centrum Wiskunde & Informatica, Amsterdam, The Netherlands 2 INRIA Lille Nord Europe, France
More informationProgramming in Scala Second Edition
Programming in Scala Second Edition Martin Odersky, Lex Spoon, Bill Venners artima ARTIMA PRESS WALNUT CREEK, CALIFORNIA Contents Contents List of Figures List of Tables List of Listings Foreword Foreword
More informationA Comparative Study of Code Query Technologies
A Comparative Study of Code Query Technologies Tiago L. Alves Jurriaan Hage Peter Rademaker Technical Report UU-CS-2011-009 April 2011 Department of Information and Computing Sciences Utrecht University,
More informationA Relational Calculus Approach to Software Analysis
A Relational Calculus Approach to Software Analysis Paul Klint 1 Q U E S T I O N... in what shape is your software? Marilyn Monroe Courtesy: www.speederich.com 2 Ferrari shape? 3 Needs-some-maintenance
More informationCA Compiler Construction
CA4003 - Compiler Construction Semantic Analysis David Sinclair Semantic Actions A compiler has to do more than just recognise if a sequence of characters forms a valid sentence in the language. It must
More informationScala, Your Next Programming Language
Scala, Your Next Programming Language (or if it is good enough for Twitter, it is good enough for me) WORLDCOMP 2011 By Dr. Mark C. Lewis Trinity University Disclaimer I am writing a Scala textbook that
More information5. Semantic Analysis. Mircea Lungu Oscar Nierstrasz
5. Semantic Analysis Mircea Lungu Oscar Nierstrasz Thanks to Jens Palsberg and Tony Hosking for their kind permission to reuse and adapt the CS132 and CS502 lecture notes. http://www.cs.ucla.edu/~palsberg/
More informationIndex. object lifetimes, and ownership, use after change by an alias errors, use after drop errors, BTreeMap, 309
A Arithmetic operation floating-point arithmetic, 11 12 integer numbers, 9 11 Arrays, 97 copying, 59 60 creation, 48 elements, 48 empty arrays and vectors, 57 58 executable program, 49 expressions, 48
More informationA User-extensible Refactoring Tool for Erlang Programs
A User-extensible Refactoring Tool for Erlang Programs Huiqing Li and Simon Thompson School of Computing, University of Kent, UK {H.Li, S.J.Thompson}@kent.ac.uk Abstract. Refactoring is the process of
More informationRECODER - The Architecture of a Refactoring System
RECODER - The Architecture of a Refactoring System Andreas Ludwig Prof. U. Aßmann http://recoder.sf.net Overview ➊Programming in the Large Problems, Concepts, The Approach ➋The Architecture of RECODER
More informationCSE413: Programming Languages and Implementation Racket structs Implementing languages with interpreters Implementing closures
CSE413: Programming Languages and Implementation Racket structs Implementing languages with interpreters Implementing closures Dan Grossman Fall 2014 Hi! I m not Hal J I love this stuff and have taught
More informationSemantics driven disambiguation A comparison of different approaches
Semantics driven disambiguation A comparison of different approaches Clément Vasseur Technical Report n o 0416, 12 2004 revision 656 Context-free grammars allow the specification
More informationsrcql: A Syntax-Aware Query Language for Source Code
srcql: A Syntax-Aware Query Language for Source Code Brian Bartman bbartman@cs.kent.edu Christian D. Newman cnewman@kent.edu Michael L. Collard The University of Akron Akron, Ohio, USA collard@uakron.edu
More informationWhat is a compiler? Xiaokang Qiu Purdue University. August 21, 2017 ECE 573
What is a compiler? Xiaokang Qiu Purdue University ECE 573 August 21, 2017 What is a compiler? What is a compiler? Traditionally: Program that analyzes and translates from a high level language (e.g.,
More informationDESIGN, EVOLUTION AND USE
DESIGN, EVOLUTION AND USE of KernelF voelter@acm.org www.voelter.de @markusvoelter Markus Völter Check out the paper! http://voelter.de/data /pub/kernelf-icmt.pdf EXAMPLE 1 Healthcare 1 Context Mobile
More informationProgramming with Math and Logic
.. Programming with Math and Logic an invitation to functional programming Ed Morehouse Wesleyan University The Plan why fp? terms types interfaces The What and Why of Functional Programming Computing
More informationHow to make a bridge between transformation and analysis technologies?
How to make a bridge between transformation and analysis technologies? J.R. Cordy and J.J. Vinju July 19, 2005 1 Introduction At the Dagstuhl seminar on Transformation Techniques in Software Engineering
More informationMIT Specifying Languages with Regular Expressions and Context-Free Grammars
MIT 6.035 Specifying Languages with Regular essions and Context-Free Grammars Martin Rinard Laboratory for Computer Science Massachusetts Institute of Technology Language Definition Problem How to precisely
More informationMIT Specifying Languages with Regular Expressions and Context-Free Grammars. Martin Rinard Massachusetts Institute of Technology
MIT 6.035 Specifying Languages with Regular essions and Context-Free Grammars Martin Rinard Massachusetts Institute of Technology Language Definition Problem How to precisely define language Layered structure
More informationRASCAL: a Domain Specific Language for Source Code Analysis and Manipulation
RASCAL: a Domain Specific Language for Source Code Analysis and Manipulation Paul Klint Tijs van der Storm Jurgen Vinju Centrum Wiskunde & Informatica and Informatics Institute, University of Amsterdam
More informationSemantics of programming languages
Semantics of programming languages Informatics 2A: Lecture 27 John Longley School of Informatics University of Edinburgh jrl@inf.ed.ac.uk 21 November, 2011 1 / 19 1 2 3 4 2 / 19 Semantics for programming
More informationProgramming Languages (PL)
1 2 3 4 5 6 7 8 9 10 11 Programming Languages (PL) Programming languages are the medium through which programmers precisely describe concepts, formulate algorithms, and reason about solutions. In the course
More information5. Semantic Analysis. Mircea Lungu Oscar Nierstrasz
5. Semantic Analysis Mircea Lungu Oscar Nierstrasz Thanks to Jens Palsberg and Tony Hosking for their kind permission to reuse and adapt the CS132 and CS502 lecture notes. http://www.cs.ucla.edu/~palsberg/
More informationOperational Semantics 1 / 13
Operational Semantics 1 / 13 Outline What is semantics? Operational Semantics What is semantics? 2 / 13 What is the meaning of a program? Recall: aspects of a language syntax: the structure of its programs
More informationWhat is a compiler? var a var b mov 3 a mov 4 r1 cmpi a r1 jge l_e mov 2 b jmp l_d l_e: mov 3 b l_d: ;done
What is a compiler? What is a compiler? Traditionally: Program that analyzes and translates from a high level language (e.g., C++) to low-level assembly language that can be executed by hardware int a,
More informationThe Syntax Definition Formalism SDF
Mark van den Brand Paul Klint Jurgen Vinju 2007-10-22 17:18:09 +0200 (Mon, 22 Oct 2007) Table of Contents An Introduction to SDF... 2 Why use SDF?... 2 How to use SDF... 4 Learning more... 4 This document...
More informationWhy Types Matter. Zheng Gao CREST, UCL
Why Types Matter Zheng Gao CREST, UCL Russell s Paradox Let R be the set of all sets that are not members of themselves. Is R a member of itself? If so, this contradicts with R s definition If not, by
More informationIntroduction to Programming Using Java (98-388)
Introduction to Programming Using Java (98-388) Understand Java fundamentals Describe the use of main in a Java application Signature of main, why it is static; how to consume an instance of your own class;
More informationDomain-Specific Languages
Domain-Specific Languages Tijs van der Storm Twitter @jurgenvinju, @inkytonik, @reallynotabba, @grammarware, @jvandenbos, @EelcoVisser, @DavyLandman, @pvgorp @Felienne, @tvdstorm #IPASpringDays Some facts
More informationHaskell in the corporate environment. Jeff Polakow October 17, 2008
Haskell in the corporate environment Jeff Polakow October 17, 2008 Talk Overview Haskell and functional programming System description Haskell in the corporate environment Functional Programming in Industry
More informationTypes for Flexible Objects
Types for Flexible Objects Building a Typed Scripting Language Pottayil Harisanker Menon, Zachary Palmer, Alexander Rozenshteyn, Scott F. Smith The Johns Hopkins University November 17th, 2014 2/1 Objective
More informationOperational Semantics of Cool
Operational Semantics of Cool Key Concepts semantics: the meaning of a program, what does program do? how the code is executed? operational semantics: high level code generation steps of calculating values
More informationConsistent Subtyping for All
Consistent Subtyping for All Ningning Xie Xuan Bi Bruno C. d. S. Oliveira 11 May, 2018 The University of Hong Kong 1 Background There has been ongoing debate about which language paradigm, static typing
More informationTopics Covered Thus Far CMSC 330: Organization of Programming Languages
Topics Covered Thus Far CMSC 330: Organization of Programming Languages Names & Binding, Type Systems Programming languages Ruby Ocaml Lambda calculus Syntax specification Regular expressions Context free
More informationafewadminnotes CSC324 Formal Language Theory Dealing with Ambiguity: Precedence Example Office Hours: (in BA 4237) Monday 3 4pm Wednesdays 1 2pm
afewadminnotes CSC324 Formal Language Theory Afsaneh Fazly 1 Office Hours: (in BA 4237) Monday 3 4pm Wednesdays 1 2pm January 16, 2013 There will be a lecture Friday January 18, 2013 @2pm. 1 Thanks to
More informationCSE341: Programming Languages Lecture 9 Function-Closure Idioms. Dan Grossman Winter 2013
CSE341: Programming Languages Lecture 9 Function-Closure Idioms Dan Grossman Winter 2013 More idioms We know the rule for lexical scope and function closures Now what is it good for A partial but wide-ranging
More informationIntroduction to OCaml
Fall 2018 Introduction to OCaml Yu Zhang Course web site: http://staff.ustc.edu.cn/~yuzhang/tpl References Learn X in Y Minutes Ocaml Real World OCaml Cornell CS 3110 Spring 2018 Data Structures and Functional
More informationEASY Meta- Programming with Rascal
EASY Meta- Programming with Rascal Paul Klint, Tijs van der Storm, Jurgen Vinju Centrum Wiskunde & Informatica and Universiteit van Amsterdam Abstract. Rascal is a new language for meta-programming and
More informationSemantic Modularization Techniques in Practice: A TAPL case study
1 Semantic Modularization Techniques in Practice: A TAPL case study Bruno C. d. S. Oliveira Joint work with Weixin Zhang, Haoyuan Zhang and Huang Li July 17, 2017 Text 2 EVF: An Extensible and Expressive
More informationLanguage engineering and Domain Specific Languages
Language engineering and Domain Specific Languages Perdita Stevens School of Informatics University of Edinburgh Plan 1. Defining languages 2. General purpose languages vs domain specific languages 3.
More informationFormal Methods in Software Design. Markus Roggenbach
Formal Methods in Software Design Markus Roggenbach October 2001 2 Formal Methods Use of mathematics in software development main activities: writing formal specifications 2 Formal Methods Use of mathematics
More informationBook. Signatures and grammars. Signatures and grammars. Syntaxes. The 4-layer architecture
Book Generic Language g Technology (2IS15) Syntaxes Software Language g Engineering g by Anneke Kleppe (Addison Wesley) Prof.dr. Mark van den Brand / Faculteit Wiskunde en Informatica 13-9-2011 PAGE 1
More informationSEN. Software Engineering. Software ENgineering. A type-driven approach to concrete meta programming. J.J. Vinju
C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a SEN Software Engineering Software ENgineering A type-driven approach to concrete meta programming J.J. Vinju REPORT SEN-E0507 APRIL 2005
More informationCS-XXX: Graduate Programming Languages. Lecture 9 Simply Typed Lambda Calculus. Dan Grossman 2012
CS-XXX: Graduate Programming Languages Lecture 9 Simply Typed Lambda Calculus Dan Grossman 2012 Types Major new topic worthy of several lectures: Type systems Continue to use (CBV) Lambda Caluclus as our
More informationValues (a.k.a. data) representation. Advanced Compiler Construction Michel Schinz
Values (a.k.a. data) representation Advanced Compiler Construction Michel Schinz 2016 03 10 The problem Values representation A compiler must have a way of representing the values of the source language
More informationValues (a.k.a. data) representation. The problem. Values representation. The problem. Advanced Compiler Construction Michel Schinz
Values (a.k.a. data) representation The problem Advanced Compiler Construction Michel Schinz 2016 03 10 1 2 Values representation The problem A compiler must have a way of representing the values of the
More informationPolymorphism. Lecture 19 CS 565 4/17/08
Polymorphism Lecture 19 CS 565 4/17/08 The Limitations of F 1 (simply-typed λ- calculus) In F 1 each function works exactly for one type Example: the identity function id = λx:τ. x : τ τ We need to write
More information0. Overview of this standard Design entities and configurations... 5
Contents 0. Overview of this standard... 1 0.1 Intent and scope of this standard... 1 0.2 Structure and terminology of this standard... 1 0.2.1 Syntactic description... 2 0.2.2 Semantic description...
More informationCSE341: Programming Languages Lecture 7 First-Class Functions. Dan Grossman Winter 2013
CSE341: Programming Languages Lecture 7 First-Class Functions Dan Grossman Winter 2013 What is functional programming? Functional programming can mean a few different things: 1. Avoiding mutation in most/all
More informationBasic concepts. Chapter Toplevel loop
Chapter 3 Basic concepts We examine in this chapter some fundamental concepts which we will use and study in the following chapters. Some of them are specific to the interface with the Caml language (toplevel,
More informationDOWNLOAD PDF CORE JAVA APTITUDE QUESTIONS AND ANSWERS
Chapter 1 : Chapter-wise Java Multiple Choice Questions and Answers Interview MCQs Java Programming questions and answers with explanation for interview, competitive examination and entrance test. Fully
More informationCSE 12 Abstract Syntax Trees
CSE 12 Abstract Syntax Trees Compilers and Interpreters Parse Trees and Abstract Syntax Trees (AST's) Creating and Evaluating AST's The Table ADT and Symbol Tables 16 Using Algorithms and Data Structures
More informationEngr. M. Fahad Khan Lecturer Software Engineering Department University Of Engineering & Technology Taxila
Engr. M. Fahad Khan Lecturer Software Engineering Department University Of Engineering & Technology Taxila Software Design and Architecture Software Design Software design is a process of problem-solving
More informationA little History Domain Specific Languages Examples Tools Benefits A more theoretical View Programming and Modeling The LWES Project Bonus: Best
Domain Specific Languages Markus Voelter Independent/itemis voelter@acm.org A little History Domain Specific Languages Examples Tools Benefits A more theoretical View Programming and Modeling The LWES
More informationCOMPUTATIONAL SEMANTICS WITH FUNCTIONAL PROGRAMMING JAN VAN EIJCK AND CHRISTINA UNGER. lg Cambridge UNIVERSITY PRESS
COMPUTATIONAL SEMANTICS WITH FUNCTIONAL PROGRAMMING JAN VAN EIJCK AND CHRISTINA UNGER lg Cambridge UNIVERSITY PRESS ^0 Contents Foreword page ix Preface xiii 1 Formal Study of Natural Language 1 1.1 The
More informationHaskell Introduction Lists Other Structures Data Structures. Haskell Introduction. Mark Snyder
Outline 1 2 3 4 What is Haskell? Haskell is a functional programming language. Characteristics functional non-strict ( lazy ) pure (no side effects*) strongly statically typed available compiled and interpreted
More informationPlan. Language engineering and Domain Specific Languages. Language designer defines syntax. How to define language
Plan Language engineering and Domain Specific Languages Perdita Stevens School of Informatics University of Edinburgh 1. Defining languages 2. General purpose languages vs domain specific languages 3.
More informationOperational Semantics. One-Slide Summary. Lecture Outline
Operational Semantics #1 One-Slide Summary Operational semantics are a precise way of specifying how to evaluate a program. A formal semantics tells you what each expression means. Meaning depends on context:
More informationIntroduction to System F. Lecture 18 CS 565 4/20/09
Introduction to System F Lecture 18 CS 565 4/20/09 The Limitations of F 1 (simply-typed λ- calculus) In F 1 each function works exactly for one type Example: the identity function id = λx:τ. x : τ τ We
More informationG Programming Languages - Fall 2012
G22.2110-003 Programming Languages - Fall 2012 Lecture 4 Thomas Wies New York University Review Last week Control Structures Selection Loops Adding Invariants Outline Subprograms Calling Sequences Parameter
More informationClojure. The Revenge of Data. by Vjeran Marcinko Kapsch CarrierCom
Clojure The Revenge of Data by Vjeran Marcinko Kapsch CarrierCom Data Processing is what we do Most programs receive, transform, search, and send data Data is raw, immutable information In its essence,
More informationCMSC 330: Organization of Programming Languages. Functional Programming with Lists
CMSC 330: Organization of Programming Languages Functional Programming with Lists CMSC330 Spring 2018 1 Lists in OCaml The basic data structure in OCaml Lists can be of arbitrary length Implemented as
More informationCompiler Design (40-414)
Compiler Design (40-414) Main Text Book: Compilers: Principles, Techniques & Tools, 2 nd ed., Aho, Lam, Sethi, and Ullman, 2007 Evaluation: Midterm Exam 35% Final Exam 35% Assignments and Quizzes 10% Project
More information