A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract Machines, Control, and Sequents
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A Relational Model of a Parallel and Non-deterministic λ -Calculus
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
| Hi-index | 0.00 |
In the ambient logic of classical second order propositional calculus, we solve the specification problem for a family of excluded middle like tautologies. These are shown to be realized by sequential simulations of specific communication schemes for which they provide a safe typing mechanism.