Sequential algorithms, deterministic parallelism, and intensional expressiveness
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finite Models and Full Completeness
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
What is a purely functional language?
Journal of Functional Programming
Comparing hierarchies of types in models of linear logic
Information and Computation
Information and Computation
Theoretical Computer Science - Applied semantics: Selected topics
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Information and Computation
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A fully abstract bidomain model of unary FPC
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Nondeterminism and observable sequentiality
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Non-uniform (hyper/multi)coherence spaces
Mathematical Structures in Computer Science
Temporal higher-order contracts
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Virtual values for language extension
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Universality results for models in locally boolean domains
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The elimination of nesting in SPCF
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Hi-index | 0.00 |