A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
The implicit calculus

2012
*
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12
*

This paper synthesizes

doi:10.1145/2254064.2254070
dblp:conf/pldi/OliveiraSCLY12
fatcat:qutlckzhrva2vinmwbgtix4nz4
*the*key ideas of*implicits*formally in*a*minimal and*general*core*calculus*called*the**implicit**calculus*(λ ? ...*Generic**programming*(GP) is an increasingly important trend in*programming*languages. ... ACKNOWLEDGMENTS We are grateful to Ben Delaware, Derek Dreyer, Jeremy Gibbons, Scott Kilpatrick, eta Ziliani,*the*members of ROPAS and*the*anonymous reviewers*for*their comments and suggestions. ...##
###
The implicit calculus

2012
*
SIGPLAN notices
*

This paper synthesizes

doi:10.1145/2345156.2254070
fatcat:2tfcedbrinckzitjsmagazk25e
*the*key ideas of*implicits*formally in*a*minimal and*general*core*calculus*called*the**implicit**calculus*(λ ? ...*Generic**programming*(GP) is an increasingly important trend in*programming*languages. ... ACKNOWLEDGMENTS We are grateful to Ben Delaware, Derek Dreyer, Jeremy Gibbons, Scott Kilpatrick, eta Ziliani,*the*members of ROPAS and*the*anonymous reviewers*for*their comments and suggestions. ...##
###
Extended Report: The Implicit Calculus
[article]

2012
*
arXiv
*
pre-print

This paper synthesizes

arXiv:1203.4499v1
fatcat:pykj7uowufhx7peh65ly4x7pum
*the*key ideas of*implicits*formally in*a*minimal and*general*core*calculus*called*the**implicit**calculus*, and it shows how to build source languages supporting*implicit*instantiation ...*Generic**programming*(GP) is an increasingly important trend in*programming*languages. ... Partial resolution adds additional expressive power and it is especially useful in*the*presence of higher-order rules. From*the*GP perspective λ⇒ offers*a**new**foundation**for**generic**programming*. ...##
###
A unifying action calculus

2011
*
Artificial Intelligence
*

We exemplify this by providing

doi:10.1016/j.artint.2010.04.010
fatcat:7s6rjfwvczhglkqx3mu5p2zija
*a**general*,*calculus*-independent solution to*a*problem of practical relevance:*the*modularity of domain axiomatizations. ... successor state axioms or*the*Fluent*Calculus*, there also exist special planning languages like ADL and approaches based on*a*linear (rather than branching) time structure like*the*Event*Calculus*. ... These are mapped onto*the**general*effect axiom (20)*for*Move(object, old,*new*) with Γ + Move def = f = On(object,*new*) ∨ f = Above(object,*new*) ∨ (∃z) (Holds(Above(*new*, z), s) ∧ f = Above(object, z)) Γ ...##
###
Dag-calculus: a calculus for parallel computation

2016
*
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming - ICFP 2016
*

Increasing availability of multicore systems has led to greater focus on

doi:10.1145/2951913.2951946
dblp:conf/icfp/AcarCRS16
fatcat:oqkznegpdffazp6aeaplvns5ca
*the*design and implementation of languages*for*writing parallel*programs*. ... These translations establish that dag*calculus*is sufficiently powerful*for*encoding*programs*written in prevailing paradigms of parallelism. ... We would like to thank*the*members of Inria's Gallium team*for*useful discussions on this paper, and*the*anonymous reviewers*for*helpful critique and feedback. ...##
###
A core calculus of composite layers

2013
*
Proceedings of the 12th workshop on Foundations of aspect-oriented languages - FOAL '13
*

*A*composite layer changes

*the*behavior of

*the*system by

*implicit*layer activation triggered by explicit activation of contexts. ... Composite layers in context-oriented

*programming*(COP) are

*the*abstraction that localizes conditions about when

*the*specified layer becomes active. ...

*For*example, TabIsFocused is

*generated*when

*the*focus of

*a*tab is changed and sent to

*the*focused tab. ...

##
###
Pure Pattern Calculus
[chapter]

2006
*
Lecture Notes in Computer Science
*

*The*simplicity and power of

*the*

*calculus*derive from allowing any term to be

*a*pattern. ... In combination, these features provide

*a*natural account of tasks such as

*programming*with XML paths. ... We would like to thank

*the*anonymous referees and Eugenio Moggi

*for*their constructive criticism. ...

##
###
The λ-calculus in the π-calculus

2011
*
Mathematical Structures in Computer Science
*

*A*

*general*approach is proposed

*for*transforming objects to methods on

*the*fly in

*the*framework of

*the*π-

*calculus*. ... But how expressive is this

*new*paradigm in comparison with traditional ones? We have already mentioned how object-oriented

*programming*fits in

*the*framework of

*the*π-

*calculus*. ... We are also grateful to

*the*two anonymous referees

*for*their detailed comments on

*a*previous version of this paper. ...

##
###
The SLam calculus

1998
*
Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98
*

To model such

doi:10.1145/268946.268976
dblp:conf/popl/HeintzeR98
fatcat:uclq7dxrcnd25m5bevbpivwudm
*a*system, we extend*the*basic*calculus*with assignment (via ML-style reference cells),*generalize*evaluation to*a*multi-process setting, and add*a*"spawn" operation to create*new*processes ... " ¤ £ £ % We view*the*SLam*calculus*as*a*first step towards providing*a*language basis*for*secure systems*programming*. ...##
###
An Imperative Pure Calculus

2016
*
Electronical Notes in Theoretical Computer Science
*

We present

doi:10.1016/j.entcs.2016.03.007
fatcat:26iv7lcnengvlgwbpd2huklv7i
*a*simple*calculus*where imperative features are modeled by just rewriting source code terms, rather than by modifying an auxiliary structure which mimics physical memory. ... We illustrate this possibility by*a*simple extension of*the*standard type system which assigns*a*capsule tag to expressions that will reduce to (values representing) isolated portions of store. ... In particular, one referee pointed out*the*analogy with scope extrusion in*the*pi-*calculus*, leading to*a*better formulation of congruence and reduction rules. ...##
###
Toward a Calculus of Confidence

2007
*
2007 First International Workshop on the Economics of Software and Computation
*

Programmers, and end-user programmers in particular, often have difficulty evaluating software, data, and communication components

doi:10.1109/esc.2007.9
fatcat:6sklexoodvhsrbxvuiznt3i6me
*for*reuse in*new*software systems, which effectively reduces*the*value ... , and developing*a*method*for*combining pieces of disparate information into overall estimates of component value. ... We will determine what attributes of this evidence are responsible*for*determining*the*credibility of*the*evidence and*for*shaping any*implicit*confidence bounds on estimates of*the*software attributes ...##
###
A Polymorphic RPC Calculus
[article]

2020
*
arXiv
*
pre-print

*The*RPC

*calculus*is

*a*simple semantic

*foundation*

*for*multi-tier

*programming*languages such as Links in which located functions can be written

*for*

*the*client-server model. ... We formulate

*a*type system

*for*

*the*polymorphic RPC

*calculus*, and prove its type soundness. ... We prove

*a*

*generalized*lemma as: if (1

*For*

*the*other base case that

*A*is

*a*type variable, say, β, we do

*a*case analysis on if β is

*the*same as α or not. ...

##
###
Semi-Axiomatic Sequent Calculus

2020
*
International Conference on Formal Structures for Computation and Deduction
*

We present

doi:10.4230/lipics.fscd.2020.29
dblp:conf/fscd/DeYoungPP20
fatcat:xkg3o2hv6rbjde2fae6hifqfpe
*the*semi-axiomatic sequent*calculus*(SAX) that blends features of Gentzen's sequent*calculus*with an axiomatic formulation of intuitionistic logic. ... We develop and prove*a*suitable analogue to cut elimination and then show that*a*natural computational interpretation of SAX provides*a*simple form of shared memory concurrency. ... Acknowledgements We would like to thank Siva Somayyajula and*the*anonymous reviewers*for*suggestions on an earlier version of this paper. ...##
###
The m-calculus

2003
*
Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '03
*

This paper presents

doi:10.1145/604131.604136
fatcat:6qolkpbiczhijjnzxm5fs32oeu
*a**new*distributed process*calculus*, called*the*M-*calculus*, that can be understood as*a*higher-order version of*the*Distributed Join*calculus*with programmable localities. ...*The**calculus*is equipped with*a*polymorphic type system that guarantees*the*unicity of locality names, even in presence of higher-order communications -*a*crucial property*for**the*determinacy of message ...*The*possibility to define, within*the*same*calculus*, different kinds of localities, with non-trivial behavior, is an important requirement*for**a*realistic*foundation*of distributed mobile*programming*. ...##
###
The m-calculus

2003
*
SIGPLAN notices
*

This paper presents

doi:10.1145/640128.604136
fatcat:x64e2vf32raitowi3fhdlec534
*a**new*distributed process*calculus*, called*the*M-*calculus*, that can be understood as*a*higher-order version of*the*Distributed Join*calculus*with programmable localities. ...*The**calculus*is equipped with*a*polymorphic type system that guarantees*the*unicity of locality names, even in presence of higher-order communications -*a*crucial property*for**the*determinacy of message ...*The*possibility to define, within*the*same*calculus*, different kinds of localities, with non-trivial behavior, is an important requirement*for**a*realistic*foundation*of distributed mobile*programming*. ...
« Previous

*Showing results 1 — 15 out of 17,031 results*