|
СТ |
Type Inference with Polymorphic Recursion |
1993 |
Henglein F. |
|
|
|
ACM Trans. Programming Languages and Systems |
28.05.1993 |
|
СТ |
Formally Optimal Boxing |
1994 |
Henglein F., Jorgensen J. |
|
|
|
Proc. of the POPL 94: 21st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages |
29.08.1997 |
|
СТ |
Polymorphic Binding-Time Analysis |
1994 |
Henglein F., Mossin C. |
|
|
|
Lecture Notes in Computer Science |
13.05.1994 |
|
СТ |
Iterative Fixed Point Computation for Type-Based Strictness Analysis |
1994 |
Henglein F. |
|
|
|
Lecture Notes in Computer Science |
24.11.1994 |
|
СТ |
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time |
1995 |
Dussart D., Henglein F., Mossin C. |
Lecture Notes in Computer Science |
|
|
Static Analysis |
16.11.1995 |
|
СТ |
A Semantic Model of Binding Times for Safe Partial Evaluation |
1995 |
Henglein F., Sands D. |
Lecture Notes in Computer Science |
|
|
Programming Languages: Implementations, Logics and Programs |
16.11.1995 |
|
СТ |
Conductive Axiomatization of Recursive Type Equality and Subtyping |
1997 |
Brandt M., Henglein F. |
|
|
|
Lecture Notes in Computer Science |
11.04.1997 |
