recentpopularlog in


« earlier   
Extensible Records in a Pure Calculus of Subtyping
Luca Cardelli

“Extensible records were introduced by Mitchell Wand while studying type inference in a polymorphic λ-calculus with record types. This paper describes a calculus with extensible records, F<:ρ, that can be translated into a simpler calculus, F<:, lacking any record primitives. Given independent axiomatizations of F<:ρ and F<: (the former being an extension of the latter) we show that the translation preserves typing, subtyping, and equality.

F<:ρ can then be used as an expressive calculus of extensible records, either directly or to give meaning to yet other languages. We show that F<:ρ can express many of the standard benchmark examples that appear in the literature.

Like other record calculi that have been proposed, F<:ρ has a rather complex set of rules but, unlike those other calculi, its rules are justified by a translation to a very simple calculus. We argue that thinking in terms of translations may help in simplifying and organizing the various record calculi that have been proposed, as well as in generating new ones.”

Mentioned in the Opa blog-post on “Power Rows.”

PLT  paper  record-calculus  to-read 
2 days ago by elliottcable
LODLAM 2017 - YouTube
ResearchSpace - a native Linked Data system via Pocket
database  linkeddata  mellon  museums  paper  uk 
3 days ago by kintopp
The Vision of Linked Open Data: Martin Wong and the METRO Network – The METRO Fellowship
This post appears as part of my 8-month fellowship with the Metropolitan New York Library Council (METRO), which ended in June 2017. My project was entitled “Interlinking Resources, Diversifying Representation: Linked Open Data in the METRO Community”. via Pocket
culture  linkeddata  paper  usa 
3 days ago by kintopp
Scalability! But at what COST?
We offer a new metric for big data platforms, COST,
or the Configuration that Outperforms a Single Thread.
scalability  performance  benchmark  benchmarking  research  paper  pdf 
3 days ago by jaskerr
Applying Formal Methods to a Certifiably Secure Software System
"A major problem in verifying the security of code is that the code's large size makes it much too costly to verify in its entirety. This article describes a novel and practical approach to verifying the security of code which substantially reduces the cost of verification. In this approach, the security property of interest is represented formally and a compact security model, containing only information needed to reason about the policy, is constructed."
paper  acm  security  programming  verification 
4 days ago by mechazoidal
Second Brain Case Study: Researching and writing a 10,000-word academic article
Note from Tiago: I recently received this unsolicited email from C. Wess Daniels, a graduate of Building a Second Brain. I’m publishing it here with his permission, with only minor edits for clarity…
fortelabs  secondbrain  tiago  forte  academic  paper  writing  10000  words  case  study  howto  tip  tips  tricks 
4 days ago by eeichinger

Copy this bookmark:

to read