Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads
Information and Computation
Using typed lambda calculus to implement formal systems on a machine
Journal of Automated Reasoning
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
A modal analysis of staged computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modal types as staging specifications for run-time code generation
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
A modal analysis of staged computation
Journal of the ACM (JACM)
Primitive Recursion for Higher-Order Abstract Syntax
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Computational types from a logical perspective
Journal of Functional Programming
A modal analysis of staged computation
Journal of the ACM (JACM)
Adaptive functional programming
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Meta-programming with names and necessity
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type theory for memory allocation and data layout
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for probabilistic languages
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
The logical approach to stack typing
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Quotient Types: A Modular Approach
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Categorical and Kripke Semantics for Constructive S4 Modal Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
From dynamic binding to state via modal possibility
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
An effective theory of type refinements
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A modal foundation for meta-variables
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
A probabilistic language based upon sampling functions
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A monadic analysis of information flow security with mutable state
Journal of Functional Programming
Monadic concurrent linear logic programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Staged computation with names and necessity
Journal of Functional Programming
CONCUR 2005 - Concurrency Theory
A modal type system for multi-level generating extensions with persistent code
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Polymorphism and separation in hoare type theory
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Adaptive functional programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the relations between monadic semantics
Theoretical Computer Science
Subtyping and intersection types revisited
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Focusing and higher-order abstract syntax
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specifying Properties of Concurrent Computations in CLF
Electronic Notes in Theoretical Computer Science (ENTCS)
Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism*
Journal of Functional Programming
ACM Transactions on Computational Logic (TOCL)
The Intensional Lambda Calculus
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
A probabilistic language based on sampling functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Design patterns in separation logic
Proceedings of the 4th international workshop on Types in language design and implementation
The Logic of Proofs as a Foundation for Certifying Mobile Computation
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Hoare type theory, polymorphism and separation1
Journal of Functional Programming
Type-safe higher-order channels with channel locality1
Journal of Functional Programming
Proofs of randomized algorithms in Coq
Science of Computer Programming
Selective Memoization with Box Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Classical Natural Deduction for S4 Modal Logic
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Verifying event-driven programs using ramified frame properties
Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
A modal deconstruction of access control logics
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Embedding Constructive K into Intuitionistic K
Electronic Notes in Theoretical Computer Science (ENTCS)
Higher-order representation of substructural logics
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Security-typed programming within dependently typed programming
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Justification logic and history based computation
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Proof-theoretic semantics for a natural language fragment
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
AuraConf: a unified approach to authorization and confidentiality
Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Stateful authorization logic: proof theory and a case study
STM'10 Proceedings of the 6th international conference on Security and trust management
Cut-free Gentzen calculus for multimodal CK
Information and Computation
A modal logic internalizing normal proofs
Information and Computation
Logical mobility and locality types
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Lambek-Calculus with general elimination rules and continuation semantics
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Proofs of randomized algorithms in CoQ
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
A modal language for the safety of mobile values
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
A proof-carrying file system with revocable and use-once certificates
STM'11 Proceedings of the 7th international conference on Security and Trust Management
Cut elimination in nested sequents for intuitionistic modal logics
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Alleged assassins: realist and constructivist semantics for modal modification
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Coeffects: unified static analysis of context-dependence
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
J-Calc: A Typed Lambda Calculus for Intuitionistic Justification Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Intuitionistic Hypothetical Logic of Proofs
Electronic Notes in Theoretical Computer Science (ENTCS)
Completeness and Soundness Results for X with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.00 |
We reconsider the foundations of modal logic, following Martin-Löf's methodology of distinguishing judgments from propositions. We give constructive meaning explanations for necessity and possibility, which yields a simple and uniform system of natural deduction for intuitionistic modal logic that does not exhibit anomalies found in other proposals. We also give a new presentation of lax logic and find that the lax modality is already expressible using possibility and necessity. Through a computational interpretation of proofs in modal logic we further obtain a new formulation of Moggi's monadic metalanguage.