Filters








580 Hits in 11.1 sec

On the relationship between compact regularity and Gentzen's cut rule

M.Andrew Moshier
2004 Theoretical Computer Science  
An object of MLS is a certain sort of generalization of the positive fragment of Gentzen's sequent calculus.  ...  The construction is a universal solution (up to a certain equivalence of tokens) to the problem of adding opposites to a logic, i.e., tokens that obey Gentzen's rules for negation.  ...  For example following Meinke and Tucker [13] , the type theory P !  ... 
doi:10.1016/j.tcs.2004.01.027 fatcat:s2zagkoyxjak7glkmqyzqx63vu

A theory of distributed aspects

Nicolas Tabareau
2010 Proceedings of the Eighth International Conference on Aspect-Oriented Software Development - AOSD '10  
The semantics of the aspect join calculus is given by a (chemical) operational semantics and a type system is developed to ensure properties satisfied by aspects during the execution of a process.  ...  We also give a translation of the aspect join calculus into the core join calculus. The translation is proved to be correct by a bisimilarity argument.  ...  A JOIN CALCULUS WITH ASPECTS In Java, the basic event of the language is the call of a method. In ML, the basic event of the language is the application of a function.  ... 
doi:10.1145/1739230.1739246 dblp:conf/aosd/Tabareau10 fatcat:xelumhbrrzg33bx2rdq3dr3uui

Algebraic Pattern Matching in Join Calculus

Qin Ma, Luc Maranget, Davide Sangiorgi
2008 Logical Methods in Computer Science  
We propose an extension of the join calculus with pattern matching on algebraic data types.  ...  To assess the correctness of our compilation scheme, we develop a theory of the applied join calculus, a calculus with value passing and value matching.  ...  Acknowledgement The authors wish to thank James Leifer and Jean-Jacques Lévy for fruitful discussions and comments. We also thank the anonymous referees for their suggestions.  ... 
doi:10.2168/lmcs-4(1:7)2008 fatcat:ej5rbd3y4zckjbbt3rdte4cixa

A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types [chapter]

Steffen van Bakel, Maria Grazia Vigliotti
2009 Lecture Notes in Computer Science  
We then define a notion of type assignment for the π-calculus that uses the type constructor →, and show that all Curry-assignable types are preserved by the encoding.  ...  We define a new, output-based encoding of the λ-calculus into the asynchronous π-calculus -enriched with pairing -that has its origin in mathematical logic, and show that this encoding respects one-step  ...  Acknowledgements We would like to thank Jan Willem Klop, Fer-Jan de Vries, and Vincent van Oostrom for their willingness to instruct, and Martin Berger for useful comments.  ... 
doi:10.1007/978-3-642-04081-8_7 fatcat:tav3tb74mzdvnaejf4uu5bs5gq

Dag-calculus: a calculus for parallel computation

Umut A. Acar, Arthur Charguéraud, Mike Rainey, Filip Sieczkowski
2016 Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming - ICFP 2016  
To this end, we propose a calculus, called dag calculus, that can encode fork-join, async-finish, and futures, and possibly others.  ...  Such languages support various abstractions for parallelism, such as fork-join, async-finish, futures.  ...  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.  ... 
doi:10.1145/2951913.2951946 dblp:conf/icfp/AcarCRS16 fatcat:oqkznegpdffazp6aeaplvns5ca

Compiling Join-Patterns1 1This work is partly supported by the ESPRIT CONFER-2 WG-21836

Fabrice Le Fessant, Luc Maranget
1998 Electronical Notes in Theoretical Computer Science  
The join-calculus is bothaname passing calculus and a core language for concurrent and distributed programming. An essential part of its implementation is the compilation of join-patterns.  ...  Join-patterns de ne new channels and all the synchronizations they take part to at the same time.  ...  The same argument applied to a la ML polymorphic typing in 6].  ... 
doi:10.1016/s1571-0661(04)00143-4 fatcat:stp6wjzrwnd6njbytogms77uvq

Functional collection programming with semi-ring dictionaries

Amir Shaikhha, Mathieu Huot, Jaclyn Smith, Dan Olteanu
2022 Proceedings of the ACM on Programming Languages (PACMPL)  
LA workloads; sparse tensor compiler taco; the Trance nested relational engine; and the in-database machine learning engines LMFAO and Morpheus for hybrid DB/LA workloads over relational data.  ...  SDQL can be competitive with or outperforms a host of systems that are state of the art in their own domain: in-memory DB systems Typer and Tectorwise for (flat, not nested) relational data; SciPy for  ...  The authors also acknowledge the EPSRC grant EP/T022124/1 (QUINTON) and Huawei for their support of the distributed data management and processing laboratory at the University of Edinburgh.  ... 
doi:10.1145/3527333 fatcat:wu7llyxxszcldjtex2kdda7vva

The Join Calculus: A Language for Distributed Mobile Programming [chapter]

Cédric Fournet, Georges Gonthier
2002 Lecture Notes in Computer Science  
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming.  ...  The join calculus is used as the basis for several distributed languages and implementations, such as JoCaml and functional nets.  ...  In the following, we rely on encodings for booleans and for integersà la Church inside the join calculus.  ... 
doi:10.1007/3-540-45699-6_6 fatcat:i2tobjoxlvhkzjbwitnec7ozca

Page 5239 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
statecharts (181-195); Cédric Fournet, Cosimo Laneve, Luc Maranget and Didier Rémy, Implicit typing 4 la ML for the join-calculus (196-212); Laurent Fribourg and Hans Olsén, Proving safety properties  ...  Shenoy, Axioms for dynamic programming (259 275); S. Aivazian [S. A. Aivazyan], Mixture-model cluster analysis using the projection pursuit method (277-286); A.  ... 

Design and Implementation of the Andromeda Proof Assistant [article]

Andrej Bauer, Gaëtan Gilbert, Philipp G. Haselwarter, Matija Pretnar, Christopher A. Stone
2018 arXiv   pre-print
We demonstrate the resulting system by showing how to axiomatize and compute with natural numbers, by axiomatizing the untyped λ-calculus, and by implementing a simple automated system for managing a universe  ...  The power of effects and handlers in AML is demonstrated by a standard library that provides default algorithms for equality checking, computation of normal forms, and implicit argument filling.  ...  In inferring mode the type A is not available. For simplicity, at present the library will report an error, although it might be better to create an implicit variable for the A : Type.  ... 
arXiv:1802.06217v1 fatcat:ioweq2oekfg5lba4d62alrln74

Proofs and Programs about Open Terms [article]

Francisco Ferreira Ruiz
2018 arXiv   pre-print
In this sense we want: easier to write programs and proofs (with implicit parameters), languages that support binders (by embedding a syntactic framework using contextual types), and the power of the logical  ...  We discuss three aspects of this: the reconstruction of implicit parameters that makes writing proofs and programs with dependent types easier, the addition of contextual objects to an existing programming  ...  la puissance du cadre logique LF jointe à une théorie des types a la Martin-Löf.  ... 
arXiv:1805.07176v1 fatcat:pxvtcretendzxgpq7bgnsgdhiu

Inheritance in the join calculus

Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy
2003 The Journal of Logic and Algebraic Programming  
We also give a polymorphic type system that statically enforces basic safety properties. Our language and its type system are compatible with the JoCaml implementation of the join calculus.  ...  We design an extension of the join calculus with class-based inheritance. Method calls, locks, and states are handled in a uniform manner, using asynchronous messages.  ...  , r) out.print_int(n) end The match construct can be understood by analogy with pattern matching à la ML, applied to the reaction rules of the parent class.  ... 
doi:10.1016/s1567-8326(03)00040-7 fatcat:hk5mk333rvadvawbtgidje5xpq

Inheritance in the Join Calculus [chapter]

Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy
2000 Lecture Notes in Computer Science  
We also give a polymorphic type system that statically enforces basic safety properties. Our language and its type system are compatible with the JoCaml implementation of the join calculus.  ...  We design an extension of the join calculus with class-based inheritance. Method calls, locks, and states are handled in a uniform manner, using asynchronous messages.  ...  , r) out.print_int(n) end The match construct can be understood by analogy with pattern matching à la ML, applied to the reaction rules of the parent class.  ... 
doi:10.1007/3-540-44450-5_32 fatcat:xgntzqc5ejdfbovrvumiqkrzpe

Functional Collection Programming with Semi-Ring Dictionaries [article]

Amir Shaikhha, Mathieu Huot, Jaclyn Smith, Dan Olteanu
2022 arXiv   pre-print
LA workloads; sparse tensor compiler taco; the Trance nested relational engine; and the in-database machine learning engines LMFAO and Morpheus for hybrid DB/LA workloads over relational data.  ...  SDQL can be competitive with or outperforms a host of systems that are state of the art in their own domain: in-memory DB systems Typer and Tectorwise for (flat, not nested) relational data; SciPy for  ...  The authors also acknowledge the EPSRC grant EP/T022124/1 (QUINTON).  ... 
arXiv:2103.06376v3 fatcat:usgoycecube55gnrdlyifs6ikq

Revisiting the notion of function

Fairouz Kamareddine, Twan Laan, Rob Nederpelt
2003 The Journal of Logic and Algebraic Programming  
We explain how both processes were implemented in Frege's Begriffschrift, Russell's Ramified Type Theory, and the λ-calculus (originally introduced by Church) showing that the λ-calculus misses a crucial  ...  PII: S 1 5 6 7 -8 3 2 6( 0 2) 0 0 0 1 6 -4 The λ-calculus does not have special notation for abstraction from a subexpression. It only has function construction in the form of λx.a.  ...  In ML (see [33] ), types are written implicitly à la Curry. For example, instead of writing λx:A.B, one writes λx.B and the type checker in ML looks for the type.  ... 
doi:10.1016/s1567-8326(02)00016-4 fatcat:263bn6dy5fawdi7rzswwrgoagi
« Previous Showing results 1 — 15 out of 580 results