Computability Theory is the foundation for computer software development. Our programming languages embody the techniques and models described by various theories of computation [1]. The Turing Machine is the canonical example of the Imperative Model [2]. Lambda Calculus is the canonical example of the Functional Model [3]. Kleene’s Church–Turing Thesis asserts the equivalence of these […]
Tag Cloud
actor asynchronous blocking capability channel composition concurrency consistency data-flow deadlock debugging distribution Erlang evaluation extensibility functional grammar Humus imperative iteration JavaScript Kernel lambda-calculus language message-passing object-oriented pair pattern-matching patterns PEG primitive protocol queue recursion scalability Scheme sequence serializer starvation state-machine streams synchronization synchronous value vau-calculusOctober 2019 S M T W T F S « Sep 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31