Sciweavers

397 search results - page 73 / 80
» The lambda calculus is algebraic
Sort
View
APAL
2007
78views more  APAL 2007»
14 years 9 months ago
Partial Horn logic and cartesian categories
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
Erik Palmgren, Steven J. Vickers
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 9 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
CALCO
2009
Springer
138views Mathematics» more  CALCO 2009»
15 years 4 months ago
Kleene Monads: Handling Iteration in a Framework of Generic Effects
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
Sergey Goncharov, Lutz Schröder, Till Mossako...
119
Voted
AOSD
2012
ACM
13 years 5 months ago
A monadic interpretation of execution levels and exceptions for AOP
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
Nicolas Tabareau
110
Voted
VMCAI
2010
Springer
15 years 4 months ago
Regular Linear Temporal Logic with Past
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
César Sánchez, Martin Leucker