User loginNavigation 
Theorem proving support in programming language semantics
More work on mechanized metatheory with an eye towards naturalness of representation and automation. This seems to me to relate to Adam Chlipala's work on A Certified TypePreserving Compiler from Lambda Calculus to Assembly Language, which relies on denotational semantics and proof by reflection, in crucial ways. More generally, it seems to reinforce an important trend in using typetheorybased theorem provers to tackle programming language design from the semantic point of view (see also A Very Modal Model of a Modern, Major, General Type System and Verifying Semantic Type Soundness of a Simple Compiler). I find the trend exciting, but of course I also wonder how far we can practically go with it today, given that the overwhelming majority of the literature, including our beloved Types and Programming Languages, is based on A Syntactic Approach to Type Soundness. Even the upcoming How to write your next POPL paper in Coq at POPL '08 centers on the syntactic approach. Is the syntactic approach barking up the wrong tree, in the long term? The semantic approach? Both? Neither? By Paul Snively at 20071227 22:21  Functional  Implementation  Lambda Calculus  Semantics  other blogs  12708 reads

Browse archivesActive forum topics 
Recent comments
8 hours 27 min ago
8 hours 29 min ago
8 hours 57 min ago
16 hours 12 min ago
16 hours 15 min ago
16 hours 47 min ago
1 day 3 hours ago
1 day 4 hours ago
1 day 7 hours ago
1 day 9 hours ago