Foundation of a computable solid modeling
Proceedings of the fifth ACM symposium on Solid modeling and applications
An Implementation of Constructive Synchronous Programs in POLIS
Formal Methods in System Design
On the asymptotic behaviour of primitive recursive algorithms
Theoretical Computer Science
Relative definability of boolean functions via hypergraphs
Theoretical Computer Science
Some Reflections on Strachey and His Work
Higher-Order and Symbolic Computation
Foundation of a computable solid modelling
Theoretical Computer Science
Exact real number computations relative to hereditarily total functionals
Theoretical Computer Science
An Algebraic Approach to Knowledge Representation
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Compositional Characterizations of lambda-Terms Using Intersection Types
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Characterising Strong Normalisation for Explicit Substitutions
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Continuous Functionals of Dependent Types and Equilogical Spaces
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
On Recognizable Languages in Divisibility Monoids
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Invited Paper: Computable Partial Solids and Voxels Sets
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
What do types mean?: from intrinsic to extrinsic semantics
Programming methodology
Decidability results for primitive recursive algorithms
Theoretical Computer Science
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
A simple proof of the undecidability of strong normalisation
Mathematical Structures in Computer Science
Reductions, intersection types, and explicit substitutions
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Parametric polymorphism and operational equivalence
Mathematical Structures in Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Principality and type inference for intersection types using expansion variables
Theoretical Computer Science
Intersection types for explicit substitutions
Information and Computation
Comparing hierarchies of types in models of linear logic
Information and Computation
Theoretical Computer Science - Mathematical foundations of programming semantics
Behavioural inverse limit λ-models
Theoretical Computer Science - Logic, semantics and theory of programming
Semantics of the reFLect language
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Linearization of the lambda-calculus and its relation with intersection type systems
Journal of Functional Programming
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Domain theory and differential calculus (functions of one variable)
Mathematical Structures in Computer Science
On the non-sequential nature of the interval-domain model of real-number computation
Mathematical Structures in Computer Science
Lambda and pi calculi, CAM and SECD machines
Journal of Functional Programming
Theoretical Computer Science
The largest Cartesian closed category of domains, considered constructively
Mathematical Structures in Computer Science
Cartesian closed stable categories
Information Sciences—Informatics and Computer Science: An International Journal
THEORETICAL PEARLS: A bargain for intersection types: a simple strong normalization proof
Journal of Functional Programming
On an open problem of Amadio and Curien: the finite antichain condition
Information and Computation
On sequential functionals of type 3
Mathematical Structures in Computer Science
Sequential algorithms and strongly stable functions
Theoretical Computer Science - Game theory meets theoretical computer science
Information and Computation
On the computational content of the Lawson topology
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Compositional characterisations of λ-terms using intersection types
Theoretical Computer Science - Mathematical foundations of computer science 2000
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
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)
Refined typechecking with Stardust
PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Domain semantics of possibility computations
Information Sciences: an International Journal
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types
Journal of the ACM (JACM)
Information systems revisited – the general continuous case
Theoretical Computer Science
Interpreting Localized Computational Effects Using Operators of Higher Type
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Syntactic Metatheory of Higher-Order Subtyping
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Theoretical Computer Science
Operational domain theory and topology of sequential programming languages
Information and Computation
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
A Proof of Plotkin's Conjecture
Fundamenta Informaticae
A Purely Definitional Universal Domain
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Effective λ-models versus recursively enumerable λ-theories
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Concrete Data Structures as Games
Electronic Notes in Theoretical Computer Science (ENTCS)
On Type Inference in the Intersection Type Discipline
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Characterising strongly normalising intuitionistic sequent terms
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Realisability semantics of parametric polymorphism, general references and recursive types
Mathematical Structures in Computer Science
Exponentials with infinite multiplicities
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Step-indexed kripke models over recursive worlds
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Information and Computation
Non-uniform (hyper/multi)coherence spaces
Mathematical Structures in Computer Science
Linearity and PCF: a semantic insight!
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Functorial boxes in string diagrams
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Universality results for models in locally boolean domains
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Axiomatic constructor classes in Isabelle/HOLCF
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Continuity and discontinuity in lambda calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A semantic formulation of ⊤⊤-lifting and logical predicates for computational metalanguage
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
An approach to innocent strategies as graphs
Information and Computation
Loader and urzyczyn are logically related
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A Proof of Plotkin's Conjecture
Fundamenta Informaticae
Formal verification of monad transformers
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Interpreting a finitary pi-calculus in differential interaction nets
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The IO and OI hierarchies revisited
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Parametric effect monads and semantics of effect systems
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Tω as a Stable Universal Domain
Electronic Notes in Theoretical Computer Science (ENTCS)
Weighted Relational Models of Typed Lambda-Calculi
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |