recentpopularlog in


« earlier   
Logic and programming languages – Dana S. Scott's Turing Award Lecture
Logic has been long interested in whether answers to certain questions are computable in principle, since the outcome puts bounds on the possibilities of formalization. More recently, precise comparisons in the efficiency of decision methods have become available through the developments in complexity theory. These, however, are applications to logic, and a big question is whether methods of logic have significance in the other direction for the more applied parts of computability theory. Progra...
pdf  programming  logic  denotational-semantics 
1 hour ago by doneata

Copy this bookmark:

to read