Handbook of theoretical computer science (vol. B)
Order-sorted polymorphism in Isabelle
Papers presented at the second annual Workshop on Logical environments
Handbook of logic in computer science (vol. 3)
Domains and lambda-calculi
The HOL Logic Extended with Quantification over Type Variables
HOL'92 Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications
HOLCF: Higher Order Logic of Computable Functions
Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Locales - A Sectioning Concept for Isabelle
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
IMPS: An Updated System Description
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
An Infrastructure for Intertheory Reasoning
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Theory Interpretations in PVS
A study of evaluation order semantics in expressions with side effects
Journal of Functional Programming
Journal of Functional Programming
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Running the manual: an approach to high-assurance microkernel development
Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Structured formal development in Isabelle
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Imperative Functional Programming with Isabelle/HOL
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Secure Microkernels, State Monads and Scalable Refinement
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
A Purely Definitional Universal Domain
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Achieving information flow security through monadic control of effects
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
A monad-based modeling and verification toolbox with application to security protocols
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
A monadic approach to automated reasoning for Bluespec SystemVerilog
Innovations in Systems and Software Engineering
Formal verification of monad transformers
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Hi-index | 0.01 |
We have definitionally extended Isabelle/HOLCF to support axiomatic Haskell-style constructor classes. We have subsequently defined the functor and monad classes, together with their laws, and implemented state and resumption monad transformers as generic constructor class instances. This is a step towards our goal of giving modular denotational semantics for concurrent lazy functional programming languages, such as GHC Haskell.