Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

First Page		Document Content
Date: 2017-09-21 08:25:51 Software engineering Computer programming Computing Functional languages Data types Type theory Logic in computer science Automated theorem proving OCaml Coq Disjoint-set data structure Proof assistant		Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits Add to Reading List Source URL: chargueraud.org Download Document from Source Website File Size: 372,81 KB Share Document on Facebook

	Synthesis of Differentiable Functional Programs for Lifelong Learning Lazar Valkov 1 Dipak Chaudhari 2 Akash Srivastava 1 Charles Sutton 1 Swarat Chaudhuri 2 1. Summary Differentiable programming languages (Paszke et al DocID: 1xVxf - View Document
	Compiling functional languages Xavier Leroy INRIA Rocquencourt Spring school “Semantics of programming languages” Agay, 24-29 March 2002 DocID: 1vcx1 - View Document
	Marcel Beemster is a Senior Software Engineer at ACE Associated Compiler Experts bv. He received his PhD from the University of Amsterdam for compiler analysis of fine-grained parallelism in functional languages and he h DocID: 1uWAg - View Document
	c 1993 Cambridge University Press J. Functional Programming 1 (1): 1{000, JanuaryBenchmarking Implementations of Functional Languages with DocID: 1uBwt - View Document
	Functional Query Languages with Categorical Types A dissertation presented by Ryan Wisnesky to DocID: 1uyFh - View Document