Filters








396 Hits in 4.2 sec

Page 7057 of Mathematical Reviews Vol. , Issue 2003i [page]

2003 Mathematical Reviews  
Intuitionistic logic and the typed lambda calculus have been the paradigm for such a correspondence. More recently, clas- sical logic has been studied from this constructive point of view.  ...  For a class of programs considered in the paper, the proposed method can expose more coarse-grain and fine-grain parallelism than a hyperplane- based loop transformation.” 2003i:68016 68N30 Moskvitin,  ... 

Towards a Substrate Framework of Computation [chapter]

Kazunori Ueda
2014 Lecture Notes in Computer Science  
Specifically, we show how fine-grained strong reduction of the λ-calculus can be concisely encoded into hypergraph rewriting with a small set of primitive operations.  ...  A grand challenge in computing is to establish a substrate computational model that encompasses diverse forms of non-sequential computation.  ...  He would like to thank anonymous referees for their careful reviewing and useful comments. This work is partially supported by Grant-In-Aid for Scientific Research ((B) 23300011), JSPS, Japan.  ... 
doi:10.1007/978-3-662-44471-9_15 fatcat:2dzmeq5m7nfbjb2loolqk6zxh4

Continuation Passing Style for Effect Handlers

Daniel Hillerström, Sam Lindley, Robert Atkey, K. C. Sivaramakrishnan, Marc Herbstritt
2017 International Conference on Rewriting Techniques and Applications  
We present Continuation Passing Style (CPS) translations for Plotkin and Pretnar's effect handlers with Hillerström and Lindley's row-typed fine-grain call-by-value calculus of effect handlers as the source  ...  We begin with a first-order CPS translation into untyped lambda calculus which manages a stack of continuations and handlers as a curried sequence of arguments.  ...  Sam Lindley was supported by EPSRC grant EP/K034413/1 (A Basis for Concurrency and Distribution).  ... 
doi:10.4230/lipics.fscd.2017.18 dblp:conf/rta/HillerstromLAS17 fatcat:qlusgstq6ngqvnryhxpwtmfkae

Dependent Information Flow Types

Luísa Lourenço, Luís Caires
2015 Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15  
Our dependent function and dependent sum information flow types provide a direct, natural and elegant way to express and enforce fine grained security policies on programs, including programs that manipulate  ...  In this paper, we develop a novel notion of dependent information flow types.  ...  We thank the anonymous reviewers for their insightful comments and suggestions. We also thank Jorge A. Perez and João C. Seco for related discussions.  ... 
doi:10.1145/2676726.2676994 dblp:conf/popl/LourencoC15 fatcat:mp4lyjxnr5htjjhogdqdoewt4i

A Design for a Security-Typed Language with Certificate-Based Declassification [chapter]

Stephen Tse, Steve Zdancewic
2005 Lecture Notes in Computer Science  
This paper presents a calculus that supports information-flow security policies and certificate-based declassification.  ...  The decentralized label model and its downgrading mechanisms are concisely expressed in the polymorphic lambda calculus with subtyping (System F ).  ...  Acknowledgments The authors thank Peng Li, Nitin Khandelwal, Eijiro Sumii, and the anonymous reviewers for their comments on drafts of this paper.  ... 
doi:10.1007/978-3-540-31987-0_20 fatcat:jik6l45g3ff4deqnlg6plklu5i

Types for Information Flow Control: Labeling Granularity and Semantic Models [article]

Vineet Rajani, Deepak Garg
2018 arXiv   pre-print
To do this, we show a semantics- and type-preserving translation from a coarse-grained type system to a fine-grained one and vice-versa.  ...  We build such logical relations for both the fine-grained type system and the coarse-grained type system. We use these relations to prove the two type systems and our translations between them sound.  ...  This work was partly supported by the German Science Foundation (DFG) through the project "Information Flow Control for Browser Clients -IFC4BC" in the priority program "Reliably Secure Software Systems  ... 
arXiv:1805.00120v1 fatcat:lr3br2prejez3dfdmlagrjscse

Tracking Data-Flow with Open Closure Types [chapter]

Gabriel Scherer, Jan Hoffmann
2013 Lecture Notes in Computer Science  
A simply-typed lambda calculus is used to study the properties of the type theory of open closure types.  ...  A publicly available prototype implementation of the system can be used to experiment with type derivations for example programs.  ...  We start from the simply-typed lambda calculus, and consider the simple intensional property of data-flow tracking, annotating each simply-typed lambda-calculus type with a single boolean variable.  ... 
doi:10.1007/978-3-642-45221-5_47 fatcat:pv42btv2pjdmfehvpquvsxefna

Combining effects and coeffects via grading

Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Flavien Breuvart, Tarmo Uustalu
2016 SIGPLAN notices  
The effectful or coeffectful behaviour of a program can be captured and described via type-based analyses, with fine grained information provided by monoidal effect annotations and semiring coeffects.  ...  ., possibly throwing exceptions but with resource requirements. To remedy this, we introduce a new general calculus with a combined effect-coeffect system.  ...  Acknowledgments The authors thank the anonymous reviewers for their helpful comments. Orchard  ... 
doi:10.1145/3022670.2951939 fatcat:koluiqnyonaabf6nbdoymmc2u4

Combining effects and coeffects via grading

Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Flavien Breuvart, Tarmo Uustalu
2016 Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming - ICFP 2016  
The effectful or coeffectful behaviour of a program can be captured and described via type-based analyses, with fine grained information provided by monoidal effect annotations and semiring coeffects.  ...  ., possibly throwing exceptions but with resource requirements. To remedy this, we introduce a new general calculus with a combined effect-coeffect system.  ...  Acknowledgments The authors thank the anonymous reviewers for their helpful comments. Orchard  ... 
doi:10.1145/2951913.2951939 dblp:conf/icfp/GaboardiKOBU16 fatcat:f55lofqgbreupmg26k3zmttuji

A calculus with polymorphic and polyvariant flow types

J. B. WELLS, ALLYN DIMOCK, ROBERT MULLER, FRANKLYN TURBAK
2002 Journal of functional programming  
We present λ CIL , a typed λ-calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages.  ...  These flow types can encode polyvariant control and data flow information within a polymorphically typed program representation.  ...  This enables type-based customizations that are more fine-grained than those possible using System F types; flow types can distinguish usage contexts for a value with a given System F type.  ... 
doi:10.1017/s0956796801004245 fatcat:cmb2ybnjijbo3ampb6f5u57dxy

Bond Portfolio Analysis with Parallel Collections in Scala

Ron, Udaya Ghattamanei, Mark Logan
2012 International Journal of Advanced Computer Science and Applications  
We developed four algorithms, each of two kinds in Scala and ran them for one to 1024 portfolios, each with a variable number of bonds with daily to yearly cash flows and 1 year to 30 year.  ...  We found we could improve upon the naïve approach with second-order efforts, namely, fine-grain parallel algorithms, which showed the overall best, statistically significant performance, followed by coarse-grain  ...  There are three types of parallel algorithms, "naïve," fine-grain, and coarse-grain. Each serial and parallel algorithm comes in two kinds: composite and memory-bound.  ... 
doi:10.14569/ijacsa.2012.030701 fatcat:lqlzyucqsjbcrmil5uufiijqee

Information Flow Analysis for Valued-Indexed Data Security Compartments [chapter]

Luísa Lourenço, Luís Caires
2014 Lecture Notes in Computer Science  
We develop a type-based information flow analysis introducing a notion of value-indexed security labels, representing value-indexed security levels, or compartments.  ...  In this paper, we investigate a programming language approach to these issues, based on a λ-calculus extended with data manipulation primitives.  ...  [16] presents an information flow analysis for a λ-calculus with references, sums, and product types.  ... 
doi:10.1007/978-3-319-14128-2_11 fatcat:6cw6eafyerayfbq75wjhmc56zi

Information Flow Analysis for Valued-Indexed Data Security Compartments [chapter]

Luísa Lourenço, Luís Caires
2014 Lecture Notes in Computer Science  
We develop a type-based information flow analysis introducing a notion of value-indexed security labels, representing value-indexed security levels, or compartments.  ...  In this paper, we investigate a programming language approach to these issues, based on a λ-calculus extended with data manipulation primitives.  ...  [16] presents an information flow analysis for a λ-calculus with references, sums, and product types.  ... 
doi:10.1007/978-3-319-05119-2_11 fatcat:jquga3pknncyrmce63zozr7ufy

Deriving Distributive Laws for Graded Linear Types

Jack Hughes, Michael Vollmer, Dominic Orchard
2021 Electronic Proceedings in Theoretical Computer Science  
The recent notion of graded modal types provides a framework for extending type theories with fine-grained data-flow reasoning. The Granule language explores this idea in the context of linear types.  ...  Along the way, we discuss interesting considerations for pattern matching analysis via graded linear types. Lastly, we show how other useful structural combinators can also be automatically derived.  ...  provides a framework for extending type theories with fine- grained data-flow reasoning.  ... 
doi:10.4204/eptcs.353.6 fatcat:dyfmyoukf5h5jlx37zx766p7bm

Learning is Change in Knowledge: Knowledge-Based Security for Dynamic Policies

Aslan Askarov, Stephen Chong
2012 2012 IEEE 25th Computer Security Foundations Symposium  
We introduce a compositional model of attackers that simplifies enforcement of security, and demonstrate that standard information-flow control mechanisms, such as security-type systems and information-flow  ...  We specify security for such systems as a simple and intuitive extensional knowledgebased semantic condition: an attacker can only learn information in accordance with the current security policy.  ...  Zheng and Myers [37] consider a lambda calculus with first-class security levels and a dependent security-type system. They assume that the security policy enforced at run time is statically known.  ... 
doi:10.1109/csf.2012.31 dblp:conf/csfw/AskarovC12 fatcat:yyosjmcukffuxks6gjvdn3hk6m
« Previous Showing results 1 — 15 out of 396 results