Normal forms and conservative properties for query languages over collection types
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantic representations and query languages for or-sets
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Delimiting the scope of effects
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A generic account of continuation-passing styles
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Isolating side effects in sequential languages
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the first ACM SIGPLAN international conference on Functional programming
A theory of weak bisimulation for core CML
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Imperative functional programming
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
On the relationship between formal semantics and static analysis
ACM Computing Surveys (CSUR)
Type-directed partial evaluation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Computing Surveys (CSUR)
Bridging the gulf: a common intermediate language for ML and Haskell
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
A systematic study of functional language implementations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Foundations for partial evaluation of functional programs with computational effects
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
The marriage of effects and monads
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Programming with variable functions
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Compiling standard ML to Java bytecodes
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed memory management in a calculus of capabilities
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Deriving backtracking monad transformers
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Timing Analysis of Combinational Circuits in Intuitionistic Propositional Logic
Formal Methods in System Design
Typed memory management via static capabilities
ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards semantics of self-adaptive software
IWSAS' 2000 Proceedings of the first international workshop on Self-adaptive software
A modal analysis of staged computation
Journal of the ACM (JACM)
Stack inspection: theory and variants
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Macros as multi-stage computations: type-safe, generative, binding macros in MacroML
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
A Hybrid Approach to Online and Offline Partial Evaluation
Higher-Order and Symbolic Computation
A fully abstract denotational semantics for the π-calculus
Theoretical Computer Science
Lifting results for categories of algebras
Theoretical Computer Science
Premonoidal categories as categories with algebraic structure
Theoretical Computer Science
Combining a monad and a comonad
Theoretical Computer Science
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Theoretical Computer Science
Towards a primitive higher order calculus of broadcasting systems
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
The marriage of effects and monads
ACM Transactions on Computational Logic (TOCL)
Retraction Approach to CPS Transform
Higher-Order and Symbolic Computation
Definitional Interpreters Revisited
Higher-Order and Symbolic Computation
Optimizing Nested Loops Using Local CPS Conversion
Higher-Order and Symbolic Computation
Axioms for Recursion in Call-by-Value
Higher-Order and Symbolic Computation
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
Stack inspection: Theory and variants
ACM Transactions on Programming Languages and Systems (TOPLAS)
Coalgebras and monads in the semantics of java
Theoretical Computer Science - Special issue: Algebraic methodology and software technology
The dual of substitution is redecoration
Trends in functional programming
A Prototype Dependency Calculus
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
A Semi-monad for Semi-structured Data
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Partial Evaluation for the Lambda Calculus
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Reasoning about Staged Computation
SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
Call-by-Push-Value: A Subsuming Paradigm
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
An Algebraic View of Program Composition
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
A Monad for Basic Java Semantics
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
A Mixin-Based, Semantics-Based Approach to Reusing Domain-Specific Programming Languages
ECOOP '00 Proceedings of the 14th European Conference on Object-Oriented Programming
Closed Freyd- and kappa-categories
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Typed Exeptions and Continuations Cannot Macro-Express Each Other
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Logical Content of Computational Type Theory: A Solution to Curry's Problem
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Verifying BDD Algorithms through Monadic Interpretation
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Calculating Functional Programs
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Directions in Functional Programming for Real(-Time) Applications
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Categories of Processes Enriched in Final Coalgebras
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Adequacy for Algebraic Effects
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A First-Order One-Pass CPS Transformation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
The Varieties of Programming Language Semantics
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
A Language Prototyping Tool Based on Semantic Building Blocks
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Interactive Programs in Dependent Type Theory
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Categorical and Kripke Semantics for Constructive S4 Modal Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Possible World Semantics for General Storage in Call-By-Value
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Constructing Tournament Representations: An Exercise in Pointwise Relational Programming
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Logical Relations for Monadic Types
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
An equational notion of lifting monad
Theoretical Computer Science - Category theory and computer science
Calculating functional programs
Algebraic and coalgebraic methods in the mathematics of program construction
A fully abstract model for the π-calculus
Information and Computation
Ideal models for pointwise relational and state-free imperative programming
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
A relational account of call-by-value sequentiality
Information and Computation - Special issue: LICS'97
Linear Logic, Monads and the Lambda Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A new framework for declarative programming
Theoretical Computer Science
A functional correspondence between evaluators and abstract machines
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A framework for typed HOAS and semantics
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
From dynamic binding to state via modal possibility
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Modelling environments in call-by-value programming languages
Information and Computation
An effective theory of type refinements
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A first-order one-pass CPS transformation
Theoretical Computer Science
Special issue: Modalities in type theory
Mathematical Structures in Computer Science
A judgmental reconstruction of modal logic
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Unique decomposition categories, Geometry of Interaction and combinatory logic
Mathematical Structures in Computer Science
Conditions for the completeness of functional and algebraic equational reasoning
Mathematical Structures in Computer Science
The call-by-value λ-calculus: a semantic investigation
Mathematical Structures in Computer Science
A categorical model for higher order imperative programming
Mathematical Structures in Computer Science
Implementing collection classes with monads
Mathematical Structures in Computer Science
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
A computational formalization for partial evaluation
Mathematical Structures in Computer Science
Action semantics reasoning about functional programs
Mathematical Structures in Computer Science
An enrichment theorem for an axiomatisation of categories of domains and continuous functions
Mathematical Structures in Computer Science
Journal of Functional Programming
Syntactic accidents in program analysis: on the impact of the CPS transformation
Journal of Functional Programming
Verification of non-functional programs using interpretations in type theory
Journal of Functional Programming
Region analysis and a π-calculus with groups
Journal of Functional Programming
Monadic encapsulation of effects: a revised approach (extended version)
Journal of Functional Programming
Journal of Functional Programming
Compilation and equivalence of imperative objects
Journal of Functional Programming
Semantics of linear/modal lambda calculus
Journal of Functional Programming
A theory of weak bisimulation for Core CML
Journal of Functional Programming
ML with Concurrency by Flemming Nielson (ed.), Springer-Verlag, 1997.
Journal of Functional Programming
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
Computational types from a logical perspective
Journal of Functional Programming
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
Journal of Functional Programming
On the call-by-value CPS transform and its semantics
Information and Computation
A definitional approach to primitivexs recursion over higher order abstract syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
A survey of semantic description frameworks for programming languages
ACM SIGPLAN Notices
Correctness of data representations involving heap data structures
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Polymorphic specialization for ML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Relating models of backtracking
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Translating dependency into parametricity
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
A methodology for generating verified combinatorial circuits
Proceedings of the 4th ACM international conference on Embedded software
A semantics for advice and dynamic join points in aspect-oriented programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modular Monadic Program Slicing
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Monadification of functional programs
Science of Computer Programming - Special issue on program transformation
THEORETICAL PEARL Church numerals, twice!
Journal of Functional Programming
A bisimulation for type abstraction and recursion
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A probabilistic language based upon sampling functions
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
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
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Journal of Functional Programming
CPS transformation of beta-redexes
Information Processing Letters
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Monadic augment and generalised short cut fusion
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Rewriting of imperative programs into logical equations
Science of Computer Programming
A monadic approach for avoiding code duplication when staging memoized functions
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Consistency of the theory of contexts
Journal of Functional Programming
Theoretical Computer Science - Algebraic methods in language processing
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
Extending separation logic with fixpoints and postponed substitution
Theoretical Computer Science - Algebraic methodology and software technology
ACM SIGPLAN Notices
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
Polymorphism and separation in hoare type theory
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Access control in a core calculus of dependency
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Programming monads operationally with Unimo
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Combining effects: sum and tensor
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Journal of Functional Programming
Boolean restriction categories and taut monads
Theoretical Computer Science
Call-by-push-value: Decomposing call-by-value and call-by-name
Higher-Order and Symbolic Computation
Semantics of an effect analysis for exceptions
TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
On a monadic semantics for freshness
Theoretical Computer Science - Applied semantics: Selected topics
Theoretical Computer Science - Applied semantics: Selected topics
Game semantics and linear CPS interpretation
Theoretical Computer Science - Foundations of software science and computation structures
Proceedings of the 6th international conference on Aspect-oriented software development
Eilenberg--Moore algebras for stochastic relations
Information and Computation
Generic models for computational effects
Theoretical Computer Science - Logic, language, information and computation
Discrete Lawvere theories and computational effects
Theoretical Computer Science - Algebra and coalgebra in computer science
Amb Breaks Well-Pointedness, Ground Amb Doesn't
Electronic Notes in Theoretical Computer Science (ENTCS)
Taut Monads, Dynamic Logic and Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational Parametricity for Control Considered as a Computational Effect
Electronic Notes in Theoretical Computer Science (ENTCS)
Access Control in a Core Calculus of Dependency
Electronic Notes in Theoretical Computer Science (ENTCS)
A Convenient Category of Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
Electronic Notes in Theoretical Computer Science (ENTCS)
Structuring Operational Semantics: Simplification and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
A monadic, functional implementation of real numbers
Mathematical Structures in Computer Science
On the relation of aspects and monads
Proceedings of the 6th workshop on Foundations of aspect-oriented languages
Specializing continuations a model for dynamic join points
Proceedings of the 6th workshop on Foundations of aspect-oriented languages
Combining algebraic effects with continuations
Theoretical Computer Science
On the relations between monadic semantics
Theoretical Computer Science
A history of Haskell: being lazy with class
Proceedings of the third ACM SIGPLAN conference on History of programming languages
A modular monadic action semantics
DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
A bisimulation for type abstraction and recursion
Journal of the ACM (JACM)
A uniform type structure for secure information flow
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constructing language processors with algebra combinators
GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Inductive reasoning about effectful data types
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Compiling with continuations, continued
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Powersets of terms and composite monads
Fuzzy Sets and Systems
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
A static simulation of dynamic delimited control
Higher-Order and Symbolic Computation
Focusing and higher-order abstract syntax
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Free-algebra models for the π -calculus
Theoretical Computer Science
Specifying Properties of Concurrent Computations in CLF
Electronic Notes in Theoretical Computer Science (ENTCS)
Cryptographic logical relations
Theoretical Computer Science
Sequential Real Number Computation and Recursive Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Domain semantics of possibility computations
Information Sciences: an International Journal
Comonadic Notions of Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Monad compositions ii: Kleisli strength
Mathematical Structures in Computer Science
Interpreting Localized Computational Effects Using Operators of Higher Type
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Variations in Access Control Logic
DEON '08 Proceedings of the 9th international conference on Deontic Logic in Computer Science
A System F with Call-by-Name Exceptions
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Asynchronous Exceptions as an Effect
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Asymptotic Improvement of Computations over Free Monads
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
A probabilistic language based on sampling functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Categorical Model of the Fusion Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Tensors of Comodels and Models for Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Linear types for computational effects
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards type-theoretic semantics for transactional concurrency
Proceedings of the 4th international workshop on Types in language design and implementation
Extensional Universal Types for Call-by-Value
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
Journal of Functional Programming
Hoare type theory, polymorphism and separation1
Journal of Functional Programming
Logical relations for monadic types†
Mathematical Structures in Computer Science
Coherence of subsumption for monadic types
Journal of Functional Programming
Quantum and Classical Structures in Nondeterminstic Computation
QI '09 Proceedings of the 3rd International Symposium on Quantum Interaction
CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Full Abstraction for Reduced ML
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Proofs of randomized algorithms in Coq
Science of Computer Programming
Extending the loop language with higher-order procedural variables
ACM Transactions on Computational Logic (TOCL)
Gabriel–ulmer duality and lawvere theories enriched over a general base
Journal of Functional Programming
Parameterised notions of computation
Journal of Functional Programming
The essence of the iterator pattern
Journal of Functional Programming
Monadic Translation of Intuitionistic Sequent Calculus
Types for Proofs and Programs
The Arrow Calculus as a Quantum Programming Language
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Transactions on Aspect-Oriented Software Development V
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Game Semantics for Access Control
Electronic Notes in Theoretical Computer Science (ENTCS)
Categories of Timed Stochastic Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names
Electronic Notes in Theoretical Computer Science (ENTCS)
Causal commutative arrows and their optimization
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Free theorems involving type constructor classes: functional pearl
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Some Domain Theory and Denotational Semantics in Coq
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
On the algebraic structure of declarative programming languages
Theoretical Computer Science
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
Journal of Functional Programming
The lambda-context calculus (extended version)
Information and Computation
Achieving information flow security through monadic control of effects
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Analysing scientific workflows with Computational Tree Logic
Cluster Computing
Composing Partially Ordered Monads
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Certifiable Specification and Verification of C Programs
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Trace Semantics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects and Operations: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
Some Characterization Results for Permutation Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects in Topological Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Monads and Adjunctions for Global Exceptions
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantics for Local Computational Effects
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Semantics of Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Ypnos: declarative, parallel structured grid programming
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
CPS transformation of beta-redexes
Information Processing Letters
Journal of Functional Programming
Modules over monads and initial semantics
Information and Computation
Comparing free algebras in Topological and Classical Domain Theory
Theoretical Computer Science
Continuation-based partial evaluation without continuations
SAS'03 Proceedings of the 10th international conference on Static analysis
Expression transformers in B-GSL
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Abstract predicates and mutable adts in hoare type theory
ESOP'07 Proceedings of the 16th European conference on Programming
A universal embedding for the higher order structure of computational effects
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Monad translating inductive and coinductive types
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Monad-independent Hoare logic in HasCasl
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
Types and effects for non-interfering program monitors
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A new one-pass transformation into monadic normal form
CC'03 Proceedings of the 12th international conference on Compiler construction
Intuitionistic refinement calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Constructing language processors with algebra combinators
Science of Computer Programming
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
On completeness of logical relations for monadic types
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Proving noninterference by a fully complete translation to the simply typed λ-calculus
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming
A framework for game-based security proofs
ICICS'07 Proceedings of the 9th international conference on Information and communications security
A logic for parametric polymorphism with effects
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Weak bisimulations for the Giry monad
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
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 linear-non-linear model for a computational call-by-value lambda calculus
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
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
The microcosm principle and concurrency in coalgebra
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A generic complete dynamic logic for reasoning about purity and effects
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Embedding Constructive K into Intuitionistic K
Electronic Notes in Theoretical Computer Science (ENTCS)
Enriching an effect calculus with linear types
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Adequacy for infinitary algebraic effects
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Algebras for parameterised monads
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Kleene monads: handling iteration in a framework of generic effects
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Complete iterativity for algebras with effects
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Coalgebraic components in a many-sorted microcosm
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A semantical approach to equilibria and rationality
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Categorifying Computations into Components via Arrows as Profunctors
Electronic Notes in Theoretical Computer Science (ENTCS)
Families of Symmetries as Efficient Models of Resource Binding
Electronic Notes in Theoretical Computer Science (ENTCS)
Selection functions, bar recursion and backward induction
Mathematical Structures in Computer Science
Coherence for monoidal endofunctors†
Mathematical Structures in Computer Science
Coherence for monoidal monads and comonads†
Mathematical Structures in Computer Science
Realisability semantics of parametric polymorphism, general references and recursive types
Mathematical Structures in Computer Science
Dartmouth internet security testbed (DIST: building a campus-wide wireless testbed
CSET'09 Proceedings of the 2nd conference on Cyber security experimentation and test
A graph model of data and workflow provenance
TAPP'10 Proceedings of the 2nd conference on Theory and practice of provenance
A Nominal Relational Model for Local Store
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
Kleisli category and database mappings
International Journal of Intelligent Information and Database Systems
Testing of abstract components
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Fibrational induction rules for initial algebras
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Monad transformers as monoid transformers
Theoretical Computer Science
Weak bisimulations for the giry monad†
Mathematical Structures in Computer Science
The computational slr: A logic for reasoning about computational indistinguishability
Mathematical Structures in Computer Science
A typed store-passing translation for general references
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for game-based security proofs
ProvSec'10 Proceedings of the 4th international conference on Provable security
A program transformation for returning states in functional-logic programs
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Cartesian effect categories are Freyd-categories
Journal of Symbolic Computation
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous
Electronic Notes in Theoretical Computer Science (ENTCS)
What is a Categorical Model of Arrows?
Electronic Notes in Theoretical Computer Science (ENTCS)
Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code
Science of Computer Programming
Aspect oriented programming: a language for 2-categories
Proceedings of the 10th international workshop on Foundations of aspect-oriented languages
Traces for coalgebraic components
Mathematical Structures in Computer Science
Freshness and name-restriction in sets of traces with names
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A bottom-up approach to understand functional programs
Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering
A monadic approach to automated reasoning for Bluespec SystemVerilog
Innovations in Systems and Software Engineering
A coinductive calculus for asynchronous side-effecting processes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Just do it: simple monadic equational reasoning
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
A counterexample to tensorability of effects
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Linearly-used state in models of call-by-value
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Monatron: an extensible monad transformer library
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Towards Effects in Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Composing reactive GUIs in F# using WebSharper
IFL'10 Proceedings of the 22nd international conference on Implementation and application of functional languages
Cut-free Gentzen calculus for multimodal CK
Information and Computation
Petri net + nested relational calculus = dataflow
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
The essence of dataflow programming
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal network packet processing with minimal fuss: invertible syntax descriptions at work
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
ICESS'04 Proceedings of the First international conference on Embedded Software and Systems
Completeness of global evaluation logic
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Automating proofs in category theory
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Journal of Functional Programming - Dedicated to ICFP 2009
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Reducibility and ⊤⊤-lifting for computation types
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
A semantic formulation of ⊤⊤-lifting and logical predicates for computational metalanguage
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Interactive Realizers: A New Approach to Program Extraction from Nonconstructive Proofs
ACM Transactions on Computational Logic (TOCL)
A monadic interpretation of execution levels and exceptions for AOP
Proceedings of the 11th annual international conference on Aspect-oriented Software Development
Combining datatypes and effects
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Proofs of randomized algorithms in CoQ
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Bimonadic semantics for basic pattern matching calculi
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Monad-Based logics for computational effects
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Proof abstraction for imperative languages
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Linearly-Used continuations in the enriched effect calculus
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Completeness for algebraic theories of local state
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
SDRT and continuation semantics
JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
An algebraic basis for specifying and enforcing access control in security systems
IW-FM'00 Proceedings of the 4th Irish conference on Formal Methods
Facilitating modular property-preserving extensions of programming languages
IW-FM'98 Proceedings of the 2nd Irish conference on Formal Methods
Modular composition of language features through extensions of semantic language models
IW-FM'99 Proceedings of the 3rd Irish conference on Formal Methods
Parameterised notions of computation
MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
The Essence of the Iterator Pattern
MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
Logic for computational effects: work in progress
IWFM'03 Proceedings of the 6th international conference on Formal Methods
On Protection by Layout Randomization
ACM Transactions on Information and System Security (TISSEC)
A compilation technique to increase X3D performance and safety
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Intermodeling, queries, and kleisli categories
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Constructive Boolean circuits and the exactness of timed ternary simulation
Formal Methods in System Design
Capsules and closures: a small-step approach
Logic and Program Semantics
Realizing monads in interaction nets via generic typed rules
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A formal abstract framework for modelling and testing complex software systems
Theoretical Computer Science
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Discrete generalised polynomial functors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Towards modular compilers for effects
TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Using functional languages to facilitate C++ metaprogramming
Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
Operational semantics using the partiality monad
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Kan extensions for program optimisation or: art and dan explain an old trick
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Names, Equations, Relations: Practical Ways to Reason about new
Fundamenta Informaticae
A Convex Powerdomain over Lattices: its Logic and λ-Calculus
Fundamenta Informaticae
A Simply Typed λ-Calculus of Forward Automatic Differentiation
Electronic Notes in Theoretical Computer Science (ENTCS)
Observationally-induced Effects in Cartesian Closed Categories
Electronic Notes in Theoretical Computer Science (ENTCS)
A Semantics For Evaluation Logic
Fundamenta Informaticae
Parameters And Parametrization In Specification, Using Distributive Categories
Fundamenta Informaticae
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Concurrency and the algebraic theory of effects
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
The confinement problem in the presence of faults
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Universal properties of impure programming languages
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Comodels and effects in mathematical operational semantics
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
An algebraic presentation of predicate logic
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Modular and automated type-soundness verification for language extensions
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Belief semantics of authorization logic
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Coeffects: unified static analysis of context-dependence
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Noninterference in a predicative polymorphic calculus for access control
Computer Languages, Systems and Structures
Parametric effect monads and semantics of effect systems
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
A coinductive calculus for asynchronous side-effecting processes
Information and Computation
Æminium: A Permission-Based Concurrent-by-Default Programming Language Approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Normalization by Evaluation and Algebraic Effects
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Weighted Relational Models of Typed Lambda-Calculi
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Instances of Computational Effects: An Algebraic Perspective
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Freyd categories are Enriched Lawvere Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.02 |