211 search results - page 32 / 43 » Reflective Programming in the Relational Algebra |
116
click to vote
ICSE
1997
IEEE-ACM
15 years 3 months ago
1997
IEEE-ACM
We apply mathematical concept analysis in order to modularize legacy code. By analysing the relation between procedures and global variables, a so-called concept lattice is constr...
ENTCS
2008
14 years 11 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
MSCS
1998
14 years 11 months ago
1998
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
208
click to vote
POPL
2009
ACM
16 years 7 days ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
ENTCS
2008
14 years 11 months ago
2008
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...