ICFP 2010 - PDF Preprint Papers

ICFP 2010 International Conference on Functional Programming

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICFP-2010 Paper

click to vote

ICFP
2010
ACM

194views Programming Languages» more ICFP 2010»

Security-typed programming within dependently typed programming

13 years 5 months ago

Download people.cs.uchicago.edu

Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and enforce access control and information flow policies. Most of ...

Jamie Morgenstern, Daniel R. Licata

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	194	Security-typed programming within dependently typed programming	claim
2	189	A certified framework for compiling and executing garbage-collected languages	claim
3	174	Lazy tree splitting	claim
4	174	Instance chains: type class programming without overlapping instances	claim
5	170	The impact of higher-order state and control effects on local relational reasoning	claim
6	166	TeachScheme!: a checkpoint	claim
7	165	ReCaml: execution state as the cornerstone of reconfigurations	claim
8	162	Bidirectionalizing graph transformations	claim
9	158	Parametricity and dependent types	claim
10	156	Lolliproc: to concurrency from classical linear logic via curry-howard and control	claim
11	153	Using functional programming within an industrial product group: perspectives and perceptions	claim
12	151	Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators	claim
13	150	Experience report: growing programming languages for beginning students	claim
14	150	Combining syntactic and semantic bidirectionalization	claim
15	148	The reduceron reconfigured	claim
16	148	Abstracting abstract machines	claim
17	143	Higher-order representation of substructural logics	claim
18	140	Distance makes the types grow stronger: a calculus for differential privacy	claim
19	137	A fresh look at programming with names and binders	claim
20	136	Logical types for untyped languages	claim
21	135	Regular, shape-polymorphic, parallel arrays in Haskell	claim
22	129	The gentle art of levitation	claim
23	129	VeriML: typed computation of logical terms inside a language with effects	claim
24	126	Rethinking supercompilation	claim
25	120	Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation	claim
26	118	Matching lenses: alignment and view update	claim
27	116	Functional pearl: every bit counts	claim
28	114	Specifying and verifying sparse matrix codes	claim
29	108	Fortifying macros	claim
30	103	Program verification through characteristic formulae	claim
31	100	Semantic subtyping with an SMT solver	claim
32	92	Total parser combinators	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers