A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Filters
Semantics for communication primitives in a polymorphic language
1993
Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93
We propose a method to extend an ML-style polymorphic language with transparent communication primitives, and give their precise operational semantics. ...
We dene a polymorphic functional calculus with transparent communication primitives, which we call dML, as an extension of Damas and Milner's proof system for ML. We then develop an al- ...
We dene a polymorphic language with transparent communication primitives, which we call dML, as an extension of Damas and Milner's [DM82] proof system for ML. ...
doi:10.1145/158511.158529
dblp:conf/popl/OhoriK93
fatcat:cgqikvsvdzfzhb2sqjjeqxwwd4
Page 499 of Mathematical Reviews Vol. , Issue 2001A
[page]
2001
Mathematical Reviews
The purpose of this paper is to develop an efficient polymorphic language frame- work that specializes polymorphic primitives using static type in- formation. ...
Specifically, the paper develops a type reconstruction method for ML-style polymorphic languages, a mechanism that can be used as an intermediate language for various polymorphic primitives, and a generic ...
Typed common intermediate format
2000
Software engineering notes
FLINT is based o n a predicative variant of the Girard-Reynolds polymorphic calculus F ! , extended with a very rich set of primitive types and functions. ...
Our key innovation is the use of a common typed intermediate language, named FLINT, to model the semantics and interactions of various language-speci c features. ...
F30602-96-2-0232, and in part by an NSF CAREER Award CCR-9501624, and NSF Grant CCR-9633390. ...
doi:10.1145/340855.341019
fatcat:zyahrvhxp5gi5idacm5m4cdvji
Safe run-time overloading
1990
Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90
Francok Rouaix INRIA' B-P.105 78153 Le Chesnay Cedez, Fence We present a functional language featuring a form of dynamic overloading akin to message passing in object oriented languages. ...
We give a dynamic semantics describing a non-dete rministic evaluation, as well as a type discipline (static semantics) supporting type inference. ...
L&y helped in choosing the dynamic semantics. ...
doi:10.1145/96709.96746
dblp:conf/popl/Rouaix90
fatcat:nrqkvrytdzftdlzqgx4nwz2bqe
Communication Primitives for Minimally Synchronous Parallel ML
[chapter]
2004
Lecture Notes in Computer Science
This paper explore two versions of an additional communication function: one uses this small set of primitives, the other one is considered as a primitive and implemented at a lower level. ...
Minimally Synchronous Parallel ML is a functional parallel language whose execution time can then be estimated and dead-locks and indeterminism are avoided. ...
Conclusions and Future Work We have explored how to write communication functions for the Minimally Synchronous Parallel ML language using only the unary get communication primitive: the get list function ...
doi:10.1007/978-3-540-24685-5_51
fatcat:gmtcoy3r4rarjldj6atmiqxnmm
Historical introduction to "concrete domains" by G. Kahn and G.D. Plotkin
1993
Theoretical Computer Science
to semantics, advocated in [37] and later applied to a wide variety of programming languages [39, 34, 42, 24] . ...
The ideas and concepts introduced in this work have been widely referenced and have become the basis for a significant body of foundational research on semantics of programming languages. ...
Acknowledgment I would like to thank Samson Abramsky, GCrard Berry, Pierre-Louis Curien, Gilles Kahn, Gordon Plotkin and Glynn Winskel for helping to clarify the history behind this work and for suggesting ...
doi:10.1016/0304-3975(93)90089-c
fatcat:mmkq4foztvfqnan3uydh5ekzpe
Making standard ML a practical database programming language
2011
SIGPLAN notices
In the integrated language, the type system always infers a principal type for any type consistent SQL expression. ...
The type system of our language is largely based on Machiavelli, which demonstrates that ML with record polymorphism can represent type structure of SQL. ...
In addition to solving technical problems in language design and typing, we have also developed an implementation technique for connecting static semantics of SQL in the host language type system, and ...
doi:10.1145/2034574.2034815
fatcat:e2izvav3c5bqde4a2yzegmwpgm
Making standard ML a practical database programming language
2011
Proceeding of the 16th ACM SIGPLAN international conference on Functional programming - ICFP '11
In the integrated language, the type system always infers a principal type for any type consistent SQL expression. ...
The type system of our language is largely based on Machiavelli, which demonstrates that ML with record polymorphism can represent type structure of SQL. ...
In addition to solving technical problems in language design and typing, we have also developed an implementation technique for connecting static semantics of SQL in the host language type system, and ...
doi:10.1145/2034773.2034815
dblp:conf/icfp/OhoriU11
fatcat:7qaly4tinjhkplmrmwiang263y
Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness
2006
Electronical Notes in Theoretical Computer Science
; and how to apply it for designing secure concurrent and distributed programming languages. ...
This paper sketches an idea on how to challenge the three security issues concentrating on code mobility, by the development of a general theory of types of the π-calculus and the higher-order π-calculus ...
language primitives such as assignment, procedure call, polymorphism, controls and objects. ...
doi:10.1016/j.entcs.2005.12.115
fatcat:nuyji5iylbgeli36wjrmm6g35a
The open and autonomous interconnection semantics
2006
Proceedings of the 8th international conference on Electronic commerce The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet - ICEC '06
Semantics is the meaning expressed by various languages and the study of meaning. ...
By surveying the origin and development of general semantics, this paper studies the semantics of future interconnection environment, proposes a new notion of open and autonomous interconnection semantics ...
EVOLVING SEMANTICS IN THE EVOLVING INTERCONNECTION ENVIRONMENT
The Evolving Semantics The semantics of natural languages have evolved for thousands of years with the development of communication in human ...
doi:10.1145/1151454.1151482
dblp:conf/ACMicec/Zhuge06
fatcat:7uxtuoz7djcrpmqyb6fnc743am
Polymorphic time systems for estimating program complexity
1992
ACM Letters on Programming Languages and Systems
may run for an arbitrary length of time. ...
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. ...
Acknowledgments We thank Jean-Pierre Talpin for his help on tricky details of the proof. We also thank Corinne Ancourt and Susan Flynn Hummel for their comments. ...
doi:10.1145/130616.130620
fatcat:qnhjdpcqtractf4huxfu3qaeva
Page 5730 of Mathematical Reviews Vol. , Issue 92j
[page]
1992
Mathematical Reviews
Summary: “The current paper deals with the issues of axiomatic semantics of communication primitives in distributed programs. ...
This leads to an ML-like polymorphic type system. ...
New implementation of a BSP composition primitive with application to the implementation of algorithmic skeletons
2009
2009 IEEE International Symposium on Parallel & Distributed Processing
BSML is a ML based language designed to code Bulk Synchronous Parallel (BSP) algorithms. It allows an estimation of execution time, avoids deadlocks and non-determinism. ...
BSML proposes an extension of ML programming with a small set of primitives. One of these primitives, called parallel superposition, allows the parallel composition of two BSP programs. ...
BSML is an extension of ML to code this kind of algorithms using a a small set of primitives which are currently implemented as a parallel library 3 for the ML programming language Objective Caml (OCaml ...
doi:10.1109/ipdps.2009.5160876
dblp:conf/ipps/GavaG09
fatcat:q76e4u7g7nftph3mtbgjwhckbu
An Action Semantics for ML Concurrency Primitives
1994
BRICS Report Series
The action semantic description of the sequential part of the language does not change at all when the concurrency primitives are added, it merely gets augmented by the description of the new features! ...
These aims are achieved simultaneously, by first giving the description of a sequential (ML-like) programming language fragment, and then extending the described language with some concurrency primitives ...
The polymorphic type information is disregarded here, as it is not relevant for the dynamic semantics of the language. response = value abstraction . ...
doi:10.7146/brics.v1i20.21647
fatcat:7n64o2kcobcfvdsfz4nr4nxspu
Polymorphic Iterable Sequential Effect Systems
[article]
2020
arXiv
pre-print
We also position effect quantales with respect to work on categorical semantics for sequential effect systems, clarifying the distinctions between these systems and our own in the course of giving a thorough ...
We present an abstract polymorphic effect system parameterized by an effect quantale -- an algebraic structure with well-defined properties that can model the effects of a range of existing sequential ...
ACKNOWLEDGMENTS We thank the anonymous TOPLAS reviewers for remarkably careful, thorough, and constructive feedback on both presentation and technical developments in earlier drafts of this paper. ...
arXiv:1808.02010v5
fatcat:bkel27dtkffujjumvlnfkcwway
« Previous
Showing results 1 — 15 out of 5,473 results