An extensible ad hoc interface between Lean and Mathematica Robert Y. Lewis Carnegie Mellon University Pittsburgh, PA, USA

First Page		Document Content
Date: 2017-09-19 19:50:55 Computing Software engineering Computer programming Functional programming Subroutines Computability theory Theoretical computer science Computer algebra systems Pattern matching Wolfram Mathematica Expr Anonymous function		An extensible ad hoc interface between Lean and Mathematica Robert Y. Lewis Carnegie Mellon University Pittsburgh, PA, USA Add to Reading List Source URL: pxtp.github.io Download Document from Source Website File Size: 275,90 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