First Page | Document Content | |
---|---|---|
Date: 2015-04-12 17:46:16Software engineering Computer programming Computing Recursion Lambda calculus Computability theory Theoretical computer science Programming idioms Functional programming Function Subroutine Fixed-point combinator | Problem Solving, Programming, and Calculation Björn Lisper School of Innovation, Design, and Engineering Mälardalen University http://www.idt.mdh.se/˜blr/Add to Reading ListSource URL: www.idt.mdh.seDownload Document from Source WebsiteFile Size: 127,42 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |