Sciweavers

397 search results - page 60 / 80
» The lambda calculus is algebraic
Sort
View
ICFP
2010
ACM
14 years 9 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
86
Voted
JUCS
2006
145views more  JUCS 2006»
14 years 9 months ago
Computer Science, Logic, Informatics Education
: Our aim is to discuss what, when and, how deep logic should be taught in the computer science education in connection with the so called "Bologna process". We survey th...
Katalin Pásztor-Varga, Magda Várter&...
IJISEC
2007
149views more  IJISEC 2007»
14 years 9 months ago
Dynamic security labels and static information flow control
This paper presents a language in which information flow is securely controlled by a type system, yet the security class of data can vary dynamically. Information flow policies ...
Lantian Zheng, Andrew C. Myers
CSL
1992
Springer
15 years 1 months ago
Communicating Evolving Algebras
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
Paola Glavan, Dean Rosenzweig
APAL
2010
123views more  APAL 2010»
14 years 9 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono