A relational approach to strictness analysis for higher-order polymorphic functions

Authors:
Samson Abramsky;Thomas P. Jensen
Affiliations:
Dept. of Computing, Imperial College, 180, Queen's Gate, London SW7 2BZ, U.K.;Dept. of Computing, Imperial College, 180, Queen's Gate, London SW7 2BZ, U.K.
Venue:
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1991

Binding time analysis: a new PERspective

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Abstract interpretation in weak powerdomains

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Parametricity as subtyping

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polymorphic strictness analysis using frontiers

PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Parametricity and local variables

Journal of the ACM (JACM)
The essence of parallel Algol

Information and Computation
The essence of parallel Algol

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Logical Relations and Parametricity - A Reynolds Programme for Category Theory and Programming Languages

Electronic Notes in Theoretical Computer Science (ENTCS)

Hi-index	0.00