Revised report on the algorithmic languageAlgol 60

Backus, J. W.; Bauer, Friedrich L.; Green, J.; Katz, Chaim; McCarthy, John; Naur, Peter; Perlis, Alan J.; Rutishauser, Heinz; Samelson, K.; Vauquois, Bernard; Wegstein, J. H.; Wijngaarden, Aart Jan van; Woodger, M.; Poel, W. L. van der

doi:10.1007/bf01386340

Cited by 49 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The concept of a type system has been a useful abstraction in the theory and practice of programming languages, since the very early days [Backus et al 1962]. Types are assigned to code fragments including variables, subroutines, and dynamic allocated objects, and their purpose is to guarantee a form of safety, i.e., that łwell-typed programs cannot go wrongž [Milner 1978], or even more complex properties, e.g., that well-typed program terminate without going wrong [Hughes et al 1996].…”

Section: Introductionmentioning

confidence: 99%

Intersection types and runtime errors in the pi-calculus

Lago

Visme

Mazza

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We introduce a type system for the π-calculus which is designed to guarantee that typable processes are well-behaved, namely they never produce a run-time error and, even if they may diverge, there is always a chance for them to łfinish their workž, i.e., to reduce to an idle process. The introduced type system is based on non-idempotent intersections, and is thus very powerful as for the class of processes it can capture. Indeed, despite the fact that the underlying property is Π 0 2-complete, there is a way to show that the system is complete, i.e., that any well-behaved process is typable, although for obvious reasons infinitely many derivations need to be considered.

show abstract

Section: Introductionmentioning

confidence: 99%