Bits and pieces of information about the parser, namer, and typer phases that turn out to be necessary just to be able to unparse Scala ASTs c Miguel Garcia, LAMP, EPFL http: lamp.epfl.ch ~magarcia - Anonymous type - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2011-01-04 07:00:46 Data types Functional languages Procedural programming languages Type theory Functional programming ALGOL 68 Type system Pattern matching Anonymous function Computing Software engineering Computer programming		Bits and pieces of information about the parser, namer, and typer phases that turn out to be necessary just to be able to unparse Scala ASTs c Miguel Garcia, LAMP, EPFL http://lamp.epfl.ch/~magarcia Add to Reading List Source URL: lampwww.epfl.ch Download Document from Source Website File Size: 513,55 KB Share Document on Facebook

	Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin University of York, UK DocID: 1xVgx - View Document
	SWiM: Secure Wildcard Pattern Matching From OT Extension Vladimir Kolesnikov1? , Mike Rosulek2 , and Ni Trieu2 1 2 DocID: 1vgge - View Document
	Regulatory sequence analysis Matrix-based pattern matching Jacques van Helden Aix-Marseille Université, France DocID: 1v6Pd - View Document
	LPEG: a new approach to pattern matching Roberto Ierusalimschy PEG: Parsing Expression Grammars DocID: 1utvV - View Document
	Analysis of Fundamental Exact and Inexact Pattern Matching Algorithms Jonathan Lee ID# DocID: 1uq9c - View Document