A composition approach to time analysis of first order lazy functional programs
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Analysis and caching of dependencies
Proceedings of the first ACM SIGPLAN international conference on Functional programming
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Contextual Petri nets, asymmetric event structures, and processes
Information and Computation
Relative definability of boolean functions via hypergraphs
Theoretical Computer Science
Quantitative Semantics Revisited
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Multirelational Semantics for ExtendedEntity-Relationship Schemata with Applications
ER '02 Proceedings of the 21st International Conference on Conceptual Modeling
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Glueing and orthogonality for models of linear logic
Theoretical Computer Science - Category theory and computer science
Topological incompleteness and order incompleteness of the lambda calculus
ACM Transactions on Computational Logic (TOCL)
Order-incompleteness and finite Lambda reduction models
Theoretical Computer Science
Universal homogeneous graph-like structures and domains
Mathematical Structures in Computer Science
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Cartesian closed stable categories
Information Sciences—Informatics and Computer Science: An International Journal
Graph models of $\lambda$-calculus at work, and variations
Mathematical Structures in Computer Science
Theoretical Computer Science - Algebraic methods in language processing
Information and Computation
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Event Domains, Stable Functions and Proof-Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Dually nondeterministic functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
Maximality and totality of stable functions in the category of stable bifinite domains
Computers & Mathematics with Applications
Logical Semantics for Stability
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Effective λ-models versus recursively enumerable λ-theories
Mathematical Structures in Computer Science
Information and Computation
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
Theoretical Computer Science
Linearity and PCF: a semantic insight!
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Bidomains and full abstraction for countable nondeterminism
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Functorial boxes in string diagrams
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
The ζ-Semantics: A Comprehensive Semantics for Functional Programs
Fundamenta Informaticae
Bi-models: Relational Versus Domain-theoretic Approaches
Fundamenta Informaticae
Lambda theories of effective lambda models
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
On the Largest Cartesian Closed Category of Stable Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Tω as a Stable Universal Domain
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |