No abstract available.
Cited By
- Lima G, Rademaker A and Uceda-Sosa R ULKB Logic: A HOL-Based Framework for Reasoning over Knowledge Graphs Formal Methods: Foundations and Applications, (55-71)
- Maruyama Y Higher-Order Fuzzy Logics and their Categorical Semantics: Higher-Order Linear Completeness and Baaz Translation via Substructural Tripos Theory 2021 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), (1-6)
- Pym D (2019). Resource semantics, ACM SIGLOG News, 6:2, (5-41), Online publication date: 22-Apr-2019.
- Litak T (2018). Infinite Populations, Choice and Determinacy, Studia Logica, 106:5, (969-999), Online publication date: 1-Oct-2018.
- Guatto A A Generalized Modality for Recursion Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, (482-491)
- Pavlovic D and Yahia M Monoidal Computer III: A Coalgebraic View of Computability and Complexity (Extended Abstract) Coalgebraic Methods in Computer Science, (167-189)
- Furber R, Kozen D, Larsen K, Mardare R and Panangaden P Unrestricted stone duality for Markov processes Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-9)
- Levy P (2017). Contextual isomorphisms, ACM SIGPLAN Notices, 52:1, (400-414), Online publication date: 11-May-2017.
- Levy P Contextual isomorphisms Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (400-414)
- Pitts A (2016). Nominal techniques, ACM SIGLOG News, 3:1, (57-72), Online publication date: 17-Feb-2016.
- Munch-Maccagnoni G and Scherer G Polarised Intermediate Representation of Lambda Calculus with Sums Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (127-140)
- O'Hearn P From Categorical Logic to Facebook Engineering Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (17-20)
- Melliès P and Zeilberger N (2015). Functors are Type Refinement Systems, ACM SIGPLAN Notices, 50:1, (3-16), Online publication date: 11-May-2015.
- Melliès P and Zeilberger N Functors are Type Refinement Systems Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (3-16)
- Munch-Maccagnoni G Formulae-as-types for an involutive negation Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (1-10)
- Maruyama Y Full Lambek Hyperdoctrine Proceedings of the 20th International Workshop on Logic, Language, Information, and Computation - Volume 8071, (211-225)
- Hines P Identities in modular arithmetic from reversible coherence operations Proceedings of the 5th international conference on Reversible Computation, (84-95)
- McKinley R (2013). Proof Nets for Herbrand’s Theorem, ACM Transactions on Computational Logic (TOCL), 14:1, (1-31), Online publication date: 1-Feb-2013.
- Mccusker G (2019). On the Semantics of the Bad-Variable Constructor in Algol-like Languages, Electronic Notes in Theoretical Computer Science (ENTCS), 83, (169-186), Online publication date: 1-Jan-2013.
- Sgarbas K (2012). Review of semantic techniques in quantum computation, edited by Simon Gay and Ian Mackie, ACM SIGACT News, 43:4, (44-48), Online publication date: 19-Dec-2012.
- Plummer A and Pollard C Agnostic possible worlds semantics Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics, (201-212)
- Mellies P Game Semantics in String Diagrams Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, (481-490)
- Paterson R Constructing applicative functors Proceedings of the 11th international conference on Mathematics of Program Construction, (300-323)
- Pollard C Are (linguists') propositions (topos) propositions? Proceedings of the 6th international conference on Logical aspects of computational linguistics, (205-218)
- Kendon V, Sebald A, Stepney S, Bechmann M, Hines P and Wagner R Heterotic computing Proceedings of the 10th international conference on Unconventional computation, (113-124)
- Pratt V Linear process algebra Proceedings of the 7th international conference on Distributed computing and internet technology, (92-111)
- Englander C and Haeusler E On the 2-categorical view of proofs Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I, (502-518)
- Mihaliček V and Pollard C Distinguishing phenogrammar from tectogrammar simplifies the analysis of interrogatives Proceedings of the 15th and 16th international conference on Formal Grammar, (130-145)
- Martin S and Pollard C Hyperintensional dynamic semantics Proceedings of the 15th and 16th international conference on Formal Grammar, (114-129)
- Martin S Weak familiarity and anaphoric accessibility in dynamic semantics Proceedings of the 15th and 16th international conference on Formal Grammar, (287-306)
- Straßburger L What is the problem with proof nets for classical logic? Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe, (406-416)
- Dougherty D and Liquori L Logic and computation in a lambda calculus with intersection and union types Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning, (173-191)
- Alves S, Fernández M, Florido M and Mackie I (2018). Linearity and iterator types for Gödel's System, Higher-Order and Symbolic Computation, 23:1, (1-27), Online publication date: 1-Mar-2010.
- Stout L (2010). A categorical semantics for fuzzy predicate logic, Fuzzy Sets and Systems, 161:3, (412-432), Online publication date: 1-Feb-2010.
- MØgelberg R (2009). From parametric polymorphism to models of polymorphic fpc, Mathematical Structures in Computer Science, 19:4, (639-686), Online publication date: 1-Aug-2009.
- Hermida C and Tennent R (2009). Monoidal Indeterminates and Categories of Possible Worlds, Electronic Notes in Theoretical Computer Science (ENTCS), 249, (39-60), Online publication date: 1-Aug-2009.
- Schröder L and Mossakowski T (2009). HasCasl, Theoretical Computer Science, 410:12-13, (1217-1260), Online publication date: 20-Mar-2009.
- Hines P (2008). Machine semantics, Theoretical Computer Science, 409:1, (1-23), Online publication date: 1-Dec-2008.
- Buisse A and Dybjer P (2008). The Interpretation of Intuitionistic Type Theory in Locally Cartesian Closed Categories -- an Intuitionistic Perspective, Electronic Notes in Theoretical Computer Science (ENTCS), 218, (21-32), Online publication date: 1-Oct-2008.
- Katsumata S A Characterisation of Lambda Definability with Sums Via T T-Closure Operators Proceedings of the 22nd international workshop on Computer Science Logic, (278-292)
- Asher N (2019). A Type Driven Theory of Predication with Complex Types, Fundamenta Informaticae, 84:2, (151-183), Online publication date: 5-Sep-2008.
- Gabbay M and Mathijssen A (2008). Capture-avoiding substitution as a nominal algebra, Formal Aspects of Computing, 20:4-5, (451-479), Online publication date: 1-Jul-2008.
- Longley J Interpreting Localized Computational Effects Using Operators of Higher Type Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms, (389-402)
- Asher N (2019). A Type Driven Theory of Predication with Complex Types, Fundamenta Informaticae, 84:2, (151-183), Online publication date: 1-Apr-2008.
- Ghilardi S, Nicolini E and Zucchelli D (2008). A comprehensive combination framework, ACM Transactions on Computational Logic (TOCL), 9:2, (1-54), Online publication date: 1-Mar-2008.
- Blass A and Gurevich Y Why sets? Pillars of computer science, (179-198)
- Kakutani Y Call-by-name and call-by-value in normal modal logic Proceedings of the 5th Asian conference on Programming languages and systems, (399-414)
- McCusker G and Pym D A games model of bunched implications Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic, (573-588)
- Schröder L Bootstrapping types and cotypes in HASCASL Proceedings of the 2nd international conference on Algebra and coalgebra in computer science, (447-461)
- Diaconescu R and Stefaneas P (2007). Ultraproducts and possible worlds semantics in institutions, Theoretical Computer Science, 379:1-2, (210-230), Online publication date: 1-Jul-2007.
- Geuvers H, Niqui M, Spitters B and Wiedijk F (2007). Constructive analysis, types and exact real numbers, Mathematical Structures in Computer Science, 17:1, (3-36), Online publication date: 1-Feb-2007.
- Jankowski A and Skowron A A wistech paradigm for intelligent systems Transactions on rough sets VI, (94-132)
- Ehrig H, Padberg J, Prange U and Habel A (2019). Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation, Fundamenta Informaticae, 74:1, (1-29), Online publication date: 31-Oct-2006.
- Alves S, Fernández M, Florido M and Mackie I The power of linear functions Proceedings of the 20th international conference on Computer Science Logic, (119-134)
- Melliès P Functorial boxes in string diagrams Proceedings of the 20th international conference on Computer Science Logic, (1-30)
- Brown C Combining type theory and untyped set theory Proceedings of the Third international joint conference on Automated Reasoning, (205-219)
- Harrison J Towards self-verification of HOL light Proceedings of the Third international joint conference on Automated Reasoning, (177-191)
- Ohta Y and Hasegawa M A terminating and confluent linear lambda calculus Proceedings of the 17th international conference on Term Rewriting and Applications, (166-180)
- Levy P Jumbo λ-calculus Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (444-455)
- Ehrig H, Padberg J, Prange U and Habel A (2019). Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation, Fundamenta Informaticae, 74:1, (1-29), Online publication date: 1-Jan-2006.
- Pitts A Alpha-structural recursion and induction Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (17-34)
- Escardó M (2004). Synthetic Topology, Electronic Notes in Theoretical Computer Science (ENTCS), 87, (21-156), Online publication date: 1-Nov-2004.
- Hermida C and Mateus P (2004). Paracategories II, Theoretical Computer Science, 311:1-3, (71-103), Online publication date: 23-Jan-2004.
- Balat V, Di Cosmo R and Fiore M Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (64-76)
- Balat V, Di Cosmo R and Fiore M (2004). Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums, ACM SIGPLAN Notices, 39:1, (64-76), Online publication date: 1-Jan-2004.
- Hermida C and Mateus P (2003). Paracategories I, Theoretical Computer Science, 309:1, (125-156), Online publication date: 2-Dec-2003.
- Kakutani Y and Hasegawa M Parameterizations and fixed-point operators on control categories Proceedings of the 6th international conference on Typed lambda calculi and applications, (180-194)
- Fujita K A sound and complete CPS-translation for λµ-calculus Proceedings of the 6th international conference on Typed lambda calculi and applications, (120-134)
- Berger U, Eberl M and Schwichtenberg H (2003). Term rewriting for normalization by evaluation, Information and Computation, 183:1, (19-42), Online publication date: 25-May-2003.
- Barthe G, Capretta V and Pons O (2003). Setoids in type theory, Journal of Functional Programming, 13:2, (261-293), Online publication date: 1-Mar-2003.
- Fiore M Semantic analysis of normalisation by evaluation for typed lambda calculus Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, (26-37)
- Hasegawa M and Kakutani Y (2019). Axioms for Recursion in Call-by-Value, Higher-Order and Symbolic Computation, 15:2-3, (235-264), Online publication date: 1-Sep-2002.
- Gabbay M and Pitts A (2018). A New Approach to Abstract Syntax with Variable Binding, Formal Aspects of Computing, 13:3-5, (341-363), Online publication date: 1-Jul-2002.
- Goguen J and Roşu G (2018). Institution Morphisms, Formal Aspects of Computing, 13:3-5, (274-307), Online publication date: 1-Jul-2002.
- Naumann D Ideal models for pointwise relational and state-free imperative programming Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, (4-15)
- Haghverdi E Partially additive categories and fully complete models of linear logic Proceedings of the 5th international conference on Typed lambda calculi and applications, (197-216)
- Pfenning F Logical frameworks Handbook of automated reasoning, (1063-1147)
- Birkedal L A General Notion of Realizability Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
- Simpson A and Plotkin G Complete Axioms for Categorical Fixed-Point Operators Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
- Tiede H (1999). Basic Simple Type Theory, J. Roger Hindley, Journal of Logic, Language and Information, 8:4, (473-476), Online publication date: 1-Oct-1999.
- Preoteasa V (2019). A Relation Between Unambiguous Regular Expressions and Abstract Data Types, Fundamenta Informaticae, 40:1, (53-77), Online publication date: 1-Jan-1999.
- Abadi M, Banerjee A, Heintze N and Riecke J A core calculus of dependency Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (147-160)
- Howard B (2019). Inductive, coinductive, and pointed types, ACM SIGPLAN Notices, 31:6, (102-109), Online publication date: 15-Jun-1996.
- Howard B Inductive, coinductive, and pointed types Proceedings of the first ACM SIGPLAN international conference on Functional programming, (102-109)
- Hyland J and Ong C Pi-calculus, dialogue games and full abstraction PCF Proceedings of the seventh international conference on Functional programming languages and computer architecture, (96-107)
- Révész G (2019). Categorical Combinators With Explicit Products, Fundamenta Informaticae, 22:1,2, (153-166), Online publication date: 1-Apr-1995.
- Bruce K and Mitchell J PER models of subtyping, recursive types and higher-order polymorphism Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (316-327)
- Filinski A Linear continuations Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (27-38)
- Wadler P The essence of functional programming Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (1-14)
- Goguen J and Burstall R (1992). Institutions: abstract model theory for specification and programming, Journal of the ACM (JACM), 39:1, (95-146), Online publication date: 2-Jan-1992.
- Saraswat V, Rinard M and Panangaden P The semantic foundations of concurrent constraint programming Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (333-352)
- Coleman W, Sanford D, De Gaetano A and Geisler F (1990). Functional models of neurobiological processes, Mathematical and Computer Modelling: An International Journal, 14, (317-321), Online publication date: 31-Dec-1991.
- Wadler P Comprehending monads Proceedings of the 1990 ACM conference on LISP and functional programming, (61-78)
- Asperti A, Ferrari G and Gorrieri R Implicative formulae in the proofs of computations' analogy Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (59-71)
- Nielson H and Nielson F Transformations on higher-order functions Proceedings of the fourth international conference on Functional programming languages and computer architecture, (129-143)
- Mitchell J and Harper R The essence of ML Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (28-46)
Index Terms
- Introduction to higher order categorical logic
Recommendations
Overview of Type-2 Fuzzy Logic Systems
Fuzzy set theory has been proposed as a means for modeling the vagueness in complex systems. Fuzzy systems usually employ type-1 fuzzy sets, representing uncertainty by numbers in the range [0, 1]. Despite commercial success of fuzzy logic, a type-1 ...
New Formulation for Representing Higher Order TSK Fuzzy Systems
This paper introduces a recursive relation between an existing Takagi–Sugeno–Kang (TSK) fuzzy system of order <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula> and systems of order <inline-formula> <tex-math notation=...
Higher-Order Fuzzy Logics and their Categorical Semantics: Higher-Order Linear Completeness and Baaz Translation via Substructural Tripos Theory
2021 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)There are, in general, two kinds of logical foundations of mathematics, namely set theory and higher-order logic (aka. type theory). Fuzzy set theory and class theory have been studied extensively for a long time. Studies on higher-order fuzzy logic, by ...