In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that ...
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...