On the public citation graph

Logic and Computer Science

https://doi.org/10.1007/bfb0093921
0 signed · 206 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1096-9942(1999)5:2<97::aid-tapo3>3.0.co;2-gopenalex-snapshot
Processes, functions, and datatypes
inferred← citeshttps://doi.org/10.1002/cpa.3160480906openalex-snapshot
Program derivation with verified transformations — a case study
inferred← citeshttps://doi.org/10.1006/inco.1996.2622openalex-snapshot
Strong Normalization from Weak Normalization in Typedλ-Calculi
inferred← citeshttps://doi.org/10.1006/inco.1998.2773openalex-snapshot
Discrimination by Parallel Observers: The Algorithm
inferred← citeshttps://doi.org/10.1006/inco.2000.2887openalex-snapshot
Higher-Order Substitutions
inferred← citeshttps://doi.org/10.1006/inco.2000.2913openalex-snapshot
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
inferred← citeshttps://doi.org/10.1007/10720084_7openalex-snapshot
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
inferred← citeshttps://doi.org/10.1007/10721959_12openalex-snapshot
The Nuprl Open Logical Environment
inferred← citeshttps://doi.org/10.1007/11417170_16openalex-snapshot
On the Degeneracy of Σ-Types in Presence of Computational Classical Logic
inferred← citeshttps://doi.org/10.1007/11591191_19openalex-snapshot
The Theorema Environment for Interactive Proof Development
inferred← citeshttps://doi.org/10.1007/11753728_27openalex-snapshot
Unwinding a Non-effective Cut Elimination Proof
inferred← citeshttps://doi.org/10.1007/11805618_29openalex-snapshot
Higher-Order Orderings for Normal Rewriting
inferred← citeshttps://doi.org/10.1007/11812289_3openalex-snapshot
Structured Induction Proofs in Isabelle/Isar
inferred← citeshttps://doi.org/10.1007/11916277_8openalex-snapshot
Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_9openalex-snapshot
Actual Arithmetic and Feasibility
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_19openalex-snapshot
A Formalisation of Java’s Exception Mechanism
inferred← citeshttps://doi.org/10.1007/3-540-45499-3_12openalex-snapshot
A Monad for Basic Java Semantics
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_9openalex-snapshot
Termination Proofs and Complexity Certification
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_25openalex-snapshot
Implicit Computational Complexity for Higher Type Functionals
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_58openalex-snapshot
A second-order pattern matching algorithm for the cube of typed λ-calculi
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_108openalex-snapshot
The Gallina specification language: A case study
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_28openalex-snapshot
Proving total correctness of programs in weak second-order logic
inferred← citeshttps://doi.org/10.1007/3-540-56979-0_2openalex-snapshot
Representation, discourse, logic and truth: Situating knowledge technology
inferred← citeshttps://doi.org/10.1007/3-540-58085-9_85openalex-snapshot
Semantics for abstract clauses
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_14openalex-snapshot
Termination proofs for higher-order rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_84openalex-snapshot
Intrinsic theories and computational complexity
inferred← citeshttps://doi.org/10.1007/3-540-60343-3_40openalex-snapshot
Computational properties of qualitative spatial reasoning: First results
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_53openalex-snapshot
On the power of simple diagrams
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_1openalex-snapshot
Topological semantics for hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_181openalex-snapshot
On modular properties of higher order extensional lambda calculi
inferred← citeshttps://doi.org/10.1007/3-540-63531-9_16openalex-snapshot
Providing automated support to deductive analysis of time critical systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_41openalex-snapshot
Substructural Verification and Computational Feasibility
inferred← citeshttps://doi.org/10.1007/978-1-4471-3016-1_25openalex-snapshot
Safe Derivations in Object Hierarchies
inferred← citeshttps://doi.org/10.1007/978-1-4471-3421-3_12openalex-snapshot
Horn Clause Logic 1992
inferred← citeshttps://doi.org/10.1007/978-3-030-23250-4_5openalex-snapshot
Relational Data Across Mathematical Libraries
inferred← citeshttps://doi.org/10.1007/978-3-030-24296-1_41openalex-snapshot
Evaluation of Tools for Analyzing Smart Contracts in Distributed Ledger Technologies
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_18openalex-snapshot
Symbolic Analysis Tools for CSP
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_1openalex-snapshot
Proof Checking and Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_9openalex-snapshot
Modules in Coq Are and Will Be Correct
inferred← citeshttps://doi.org/10.1007/978-3-540-27818-4_15openalex-snapshot
Predicate Logic with Sequence Variables and Sequence Function Symbols
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_12openalex-snapshot
Theorem Reuse by Proof Term Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_20openalex-snapshot
Formalizing Integration Theory with an Application to Probabilistic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-30182-0_98openalex-snapshot
Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_14openalex-snapshot
Solving Equations Involving Sequence Variables and Sequence Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_20openalex-snapshot
Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy
inferred← citeshttps://doi.org/10.1007/978-3-540-30498-2_37openalex-snapshot
A Rippling-Based Difference Reduction Technique to Automatically Prove Security Protocol Goals
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_54openalex-snapshot
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-69611-7_20openalex-snapshot
Aspect-Oriented Programming in Higher-Order and Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_7openalex-snapshot
The Isabelle Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_23openalex-snapshot
On the Stability by Union of Reducibility Candidates
inferred← citeshttps://doi.org/10.1007/978-3-540-73445-1_12openalex-snapshot
A Formal Calculus for Informal Equality with Binding
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_22openalex-snapshot
Sequence Unification Through Currying
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_10openalex-snapshot
(In)consistency of Extensions of Higher Order Logic and Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_11openalex-snapshot
Constructive Type Classes in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_26openalex-snapshot
Building Formal Method Tools in the Isabelle/Isar Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-76786-2_5openalex-snapshot
Generic Programming in Ωmega
inferred← citeshttps://doi.org/10.1007/978-3-540-85110-3_31openalex-snapshot
Logic-Free Reasoning in Isabelle/Isar
inferred← citeshttps://doi.org/10.1007/978-3-540-88059-2_5openalex-snapshot
Programming in Ωmega
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_10openalex-snapshot
Local Theory Specifications in Isabelle/Isar
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_16openalex-snapshot
On Stratified Regions
inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_16openalex-snapshot
Matrices as Arrows!
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_12openalex-snapshot
Proof-Theoretic and Higher-Order Extensions of Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-31262-5_12openalex-snapshot
Common Nouns as Types
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_30openalex-snapshot
Shared-Memory Multiprocessing for Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_2openalex-snapshot
Notes on the Simply Typed Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_4openalex-snapshot
The Structure of Nuprl’s Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_5openalex-snapshot
Axiomatisations, Proofs, and Formal Specifications of Algorithms: Commented Case Studies in the Coq Proof Assistant
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_9openalex-snapshot
Linear Logic and Computation: A Survey
inferred← citeshttps://doi.org/10.1007/978-94-007-4435-6_15openalex-snapshot
Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions
inferred← citeshttps://doi.org/10.1007/978-94-010-0526-5_14openalex-snapshot
Peano’s Lambda Calculus: The Functional Abstraction Implicit in Arithmetic
inferred← citeshttps://doi.org/10.1007/978-94-015-9586-5_4openalex-snapshot
Temporal Logic for Stabilizing Systems
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_5openalex-snapshot
Tableaux for Intuitionistic Logics
inferred← citeshttps://doi.org/10.1007/bfb0022246openalex-snapshot
Decidability of higher-order subtyping with intersection types
inferred← citeshttps://doi.org/10.1007/s00165-009-0136-5openalex-snapshot
Structured derivations: a unified proof style for teaching mathematics
inferred← citeshttps://doi.org/10.1007/s00165-016-0393-zopenalex-snapshot
Proof checking and logic programming
inferred← citeshttps://doi.org/10.1007/s11786-010-0025-6openalex-snapshot
Tactics for Hierarchical Proof
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00113-1openalex-snapshot
Planning from second principles
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00056-7openalex-snapshot
Strong normalization for non-structural subtyping via saturated sets
inferred← citeshttps://doi.org/10.1016/0165-0114(95)00199-9openalex-snapshot
Tableau method for residuated logic
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00021-6openalex-snapshot
An algorithm for type-checking dependent types
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00004-zopenalex-snapshot
A strong normalization result for classical logic
inferred← citeshttps://doi.org/10.1016/0169-023x(95)00039-uopenalex-snapshot
A basic calculus for verifying properties of interacting objects
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90109-uopenalex-snapshot
Metacircularity in the polymorphic λ-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90037-3openalex-snapshot
Polymorphic rewriting conserves algebraic strong normalization
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90011-hopenalex-snapshot
Constructive logics Part I: A tutorial on proof systems and typed λ-calculi
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90075-5openalex-snapshot
Higher-order unification via combinators
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90094-aopenalex-snapshot
Set-theoretical and other elementary models of the λ-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90175-sopenalex-snapshot
The undecidability of pattern matching in calculi where primitive recursive functions are representable
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90181-ropenalex-snapshot
Computational interpretations of linear logic
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00184-kopenalex-snapshot
Formalizing Dijkstra's predicate transformer wp in weak second-order logic
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00280-0openalex-snapshot
Proving properties of typed λ-terms using realizability, covers, and sheaves
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90080-9openalex-snapshot
F-semantics for type assignment systems
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00045-xopenalex-snapshot
Forum: A multiple-conclusion specification logic
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90053-5openalex-snapshot
Finitely stratified polymorphism
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-0-444-53726-3.00011-6openalex-snapshot
Types
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50011-5openalex-snapshot
A Sequent Formulation of a Logic of Predicates in HOL
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50012-7openalex-snapshot
A Classical Type Theory with Transfinite Types
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50041-3openalex-snapshot
Adding New Rules to an LCF-style Logic Implementation
inferred← citeshttps://doi.org/10.1016/b978-0-444-89901-9.50024-0openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50006-0openalex-snapshot
The Inverse Method
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50019-9openalex-snapshot
Logical Frameworks
inferred← citeshttps://doi.org/10.1016/b978-044481714-3/50013-8openalex-snapshot
Types
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50035-7openalex-snapshot
Algebraic Process Verification
inferred← citeshttps://doi.org/10.1016/j.apal.2005.05.009openalex-snapshot
A simple proof of second-order strong normalization with permutative conversions
inferred← citeshttps://doi.org/10.1016/j.apal.2007.10.010openalex-snapshot
Generalizing proofs in monadic languages
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.12.008openalex-snapshot
Higher-order associative commutative pattern matching for component retrieval
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.006openalex-snapshot
A Proof Search Specification of the π-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.007openalex-snapshot
The Linear Logical Abstract Machine
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.040openalex-snapshot
Type-level Computation Using Narrowing in Ωmega
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.02.020openalex-snapshot
The Recursion Scheme from the Cofree Recursive Comonad
inferred← citeshttps://doi.org/10.1016/j.ic.2003.09.004openalex-snapshot
Intersection types for explicit substitutions
inferred← citeshttps://doi.org/10.1016/j.ic.2004.01.001openalex-snapshot
Higher-order subtyping and its decidability
inferred← citeshttps://doi.org/10.1016/j.jal.2004.02.003openalex-snapshot
Interpreting HOL in the calculus of constructions
inferred← citeshttps://doi.org/10.1016/j.jal.2004.02.004openalex-snapshot
Variants of the basic calculus of constructions
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.01.004openalex-snapshot
Deriving a Floyd–Hoare logic for non-local jumps from a formulæ-as-types notion of control
inferred← citeshttps://doi.org/10.1016/j.jsc.2006.12.002openalex-snapshot
Solving equations with sequence variables and sequence functions
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.05.001openalex-snapshot
Flat matching
inferred← citeshttps://doi.org/10.1016/j.jsc.2009.07.001openalex-snapshot
On the relation between Context and Sequence Unification
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.035openalex-snapshot
, , and Non-Permutability of -Steps
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.042openalex-snapshot
The Girard–Reynolds isomorphism (second edition)
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.018openalex-snapshot
Calculi, types and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.018openalex-snapshot
Strong normalization from an unusual point of view
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.045openalex-snapshot
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00076-4openalex-snapshot
Knowledge-based proof planning
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80018-2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80062-5openalex-snapshot
A new paradox in type theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70234-9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80023-2openalex-snapshot
The Lengths of Proofs
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80025-6openalex-snapshot
Types in Logic, Mathematics and Programming
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00078-1openalex-snapshot
Intrinsic reasoning about functional programs I: first order theories
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00008-5openalex-snapshot
On the proof theory of Coquand's calculus of constructions
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00036-xopenalex-snapshot
Comparing cubes of typed and type assignment systems
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00047-xopenalex-snapshot
Typing untyped λ-terms, or reducibility strikes again!
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00040-2openalex-snapshot
Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00347-9openalex-snapshot
Inductive-data-type systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00356-xopenalex-snapshot
Completeness of type assignment systems with intersection, union, and type quantifiers
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00168-2openalex-snapshot
Encoding transition systems in sequent calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00096-5openalex-snapshot
Higher-order subtyping
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00161-2openalex-snapshot
Abstract data type systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00263-0openalex-snapshot
Intersection type assignment systems with higher-order algebraic rewriting
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00141-2openalex-snapshot
Unification with extended patterns
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00141-xopenalex-snapshot
The Girard–Reynolds isomorphism
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00028-3openalex-snapshot
On a Modal λ-Calculus for S4
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00279-8openalex-snapshot
Encoding Generic Judgments
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80088-4openalex-snapshot
Relating Natural Deduction and Sequent Calculus for Intuitionistic Non-Commutative Linear Logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80490-0openalex-snapshot
Strong Normalization with Singleton Types
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80139-2openalex-snapshot
Simple Network Protocol Simulation within Maude
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80686-3openalex-snapshot
Operational Subsumption, an Ideal Model of Subtyping
inferred← citeshttps://doi.org/10.1017/cbo9780511863196.020openalex-snapshot
Turing's ‘Oracle’: From Absolute to Relative Computability and Back
inferred← citeshttps://doi.org/10.1017/cbo9781139032636openalex-snapshot
Lambda Calculus with Types
inferred← citeshttps://doi.org/10.1017/s0956796800001143openalex-snapshot
The complexity of type inference for higher-order typed lambda calculi
inferred← citeshttps://doi.org/10.1017/s0956796800001246openalex-snapshot
Strong normalisation for the linear term calculus
inferred← citeshttps://doi.org/10.1017/s0956796800001829openalex-snapshot
Proof-irrelevance out of excluded-middle and choice in the calculus of constructions
inferred← citeshttps://doi.org/10.1017/s0956796800020025openalex-snapshot
Introduction to generalized type systems
inferred← citeshttps://doi.org/10.1017/s0956796810000079openalex-snapshot
Parametricity, type equality, and higher-order polymorphism
inferred← citeshttps://doi.org/10.1017/s0956796815000155openalex-snapshot
Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm
inferred← citeshttps://doi.org/10.1017/s0960129500070043openalex-snapshot
Higher-order intersection types and multiple inheritance
inferred← citeshttps://doi.org/10.1017/s0960129511000272openalex-snapshot
Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
inferred← citeshttps://doi.org/10.1017/s0960129516000104openalex-snapshot
A realizability interpretation of Church's simple theory of types
inferred← citeshttps://doi.org/10.1093/jigpal/jzq006openalex-snapshot
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
inferred← citeshttps://doi.org/10.1093/jigpal/jzr048openalex-snapshot
Computer-assisted human-oriented inductive theorem proving by descente infinie--a manifesto
inferred← citeshttps://doi.org/10.1098/rsta.2005.1656openalex-snapshot
The mathematical significance of proof theory
inferred← citeshttps://doi.org/10.1098/rsta.2014.0234openalex-snapshot
Tactics for mechanized reasoning: a commentary on Milner (1984) ‘The use of machines to assist in rigorous proof’
inferred← citeshttps://doi.org/10.1109/ase.1997.632818openalex-snapshot
Automatic synthesis of recursive programs: the proof-planning paradigm
inferred← citeshttps://doi.org/10.1109/ftdcs.1995.525020openalex-snapshot
Enforcing management policies in distributed systems
inferred← citeshttps://doi.org/10.1109/icnidc.2009.5360952openalex-snapshot
Operator matching in fuzzy decision tree based on sound logic
inferred← citeshttps://doi.org/10.1109/iwssd.1993.315502openalex-snapshot
A framework for program development based on schematic proof
inferred← citeshttps://doi.org/10.1109/lics.1991.151625openalex-snapshot
A foundational delineation of computational feasibility
inferred← citeshttps://doi.org/10.1109/lics.1991.151628openalex-snapshot
Logic programming in a fragment of intuitionistic linear logic
inferred← citeshttps://doi.org/10.1109/lics.1991.151630openalex-snapshot
Linearizing intuitionistic implication
inferred← citeshttps://doi.org/10.1109/lics.1991.151633openalex-snapshot
Partial objects in the calculus of constructions
inferred← citeshttps://doi.org/10.1109/lics.1991.151658openalex-snapshot
Higher-order critical pairs
inferred← citeshttps://doi.org/10.1109/lics.1991.151659openalex-snapshot
A computation model for executable higher-order algebraic specification languages
inferred← citeshttps://doi.org/10.1109/lics.1993.287599openalex-snapshot
Functional unification of higher-order patterns
inferred← citeshttps://doi.org/10.1109/lics.1993.287602openalex-snapshot
Strong normalization for second order classical natural deduction
inferred← citeshttps://doi.org/10.1109/lics.1994.316059openalex-snapshot
The emptiness problem for intersection types
inferred← citeshttps://doi.org/10.1109/lics.1997.614965openalex-snapshot
Discrimination by parallel observers
inferred← citeshttps://doi.org/10.1109/lics.1998.705672openalex-snapshot
Completeness of type assignment systems with intersection, union, and type quantifiers
inferred← citeshttps://doi.org/10.1109/lics.1999.782635openalex-snapshot
The higher-order recursive path ordering
inferred← citeshttps://doi.org/10.1109/sdne.1995.470461openalex-snapshot
On a rule based management architecture
inferred← citeshttps://doi.org/10.1109/tai.1993.633951openalex-snapshot
A combined object-oriented and logic programming tool for AI
inferred← citeshttps://doi.org/10.1111/j.1746-8361.2008.01141.xopenalex-snapshot
Gödel's Functional Interpretation and its Use in Current Mathematics
inferred← citeshttps://doi.org/10.1145/1028664.1028711openalex-snapshot
Languages of the future
inferred← citeshttps://doi.org/10.1145/1052883.1052897openalex-snapshot
Languages of the future
inferred← citeshttps://doi.org/10.1145/1088348.1088356openalex-snapshot
Putting curry-howard to work
inferred← citeshttps://doi.org/10.1145/1141277.1141710openalex-snapshot
The meta-object facility typed
inferred← citeshttps://doi.org/10.1145/1836089.1836111openalex-snapshot
Permissive-nominal logic
inferred← citeshttps://doi.org/10.1145/1838599.1838621openalex-snapshot
CTP-based programming languages?
inferred← citeshttps://doi.org/10.1145/2103786.2103797openalex-snapshot
Type systems for dummies
inferred← citeshttps://doi.org/10.1145/2108144.2108155openalex-snapshot
Interoperability of constrained finite state automata
inferred← citeshttps://doi.org/10.1145/267895.267912openalex-snapshot
Providing automated support to deductive analysis of time critical systems
inferred← citeshttps://doi.org/10.1145/267896.267912openalex-snapshot
Providing automated support to deductive analysis of time critical systems
inferred← citeshttps://doi.org/10.1145/2854065.2854070openalex-snapshot
Towards a Mizar environment for Isabelle: foundations and language
inferred← citeshttps://doi.org/10.1145/317636.317789openalex-snapshot
Type fixpoints
inferred← citeshttps://doi.org/10.1145/317765.317789openalex-snapshot
Type fixpoints
inferred← citeshttps://doi.org/10.1145/333580.333590openalex-snapshot
Foundational aspects of syntax
inferred← citeshttps://doi.org/10.1145/581478.581496openalex-snapshot
Type classes with more higher-order polymorphism
inferred← citeshttps://doi.org/10.1145/583852.581496openalex-snapshot
Type classes with more higher-order polymorphism
inferred← citeshttps://doi.org/10.1201/b16812-79openalex-snapshot
Type Systems
showing the first 200 of 206 · page through all 206
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.