yusuke1997/dblp-id-title huggingface dataset:
Game Equilibria and Transition Dynamics with Networks Unification
Parallel DC Cutting Plane Algorithms for Mixed Binary Linear Program
Customer Clustering of French Transmission System Operator (RTE) Based on Their Electricity Consumption
A Global Optimization Algorithm for the Solution of Tri-Level Mixed-Integer Quadratic Programming Problems
New Dynamic Programming Approach to Global Optimization
Tropical Analogues of a Dempe-Franke Bilevel Optimization Problem
Kriging-Based Reliability-Based Design Optimization Using Single Loop Approach
Reversed Search Maximum Clique Algorithm Based on Recoloring
Intelligent Solution System Towards Parts Logistics Optimization
A Mixture Design of Experiments Approach for Genetic Algorithm Tuning Applied to Multi-objective Optimization
SOP-Hybrid: A Parallel Surrogate-Based Candidate Search Algorithm for Expensive Optimization on Large Parallel Clusters
Tractable Relaxations for the Cubic One-Spherical Optimization Problem
Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations
Discrete Interval Adjoints in Unconstrained Global Optimization
Bayesian Optimization for Recommender System
A Study on Graph-Structured Recurrent Neural Networks and Sparsification with Application to Epidemic Forecasting
A Genetic Algorithm for Solving the Truck-Drone-ATV Routing Problem
K-Medoids Clustering Is Solvable in Polynomial Time for a 2d Pareto Front
Stochastic Tunneling for Improving the Efficiency of Stochastic Efficient Global Optimization
Minimax Inequalities and Variational Equations
Robust Design of Pumping Stations in Water Distribution Networks
Filtering Domains of Factorable Functions Using Interval Contractors
On Monotone Maps: Semidifferentiable Case
Asymptotically Exact Minimizations for Optimal Management of Public Finances
A Numerical Study on MIP Approaches over the Efficient Set
\varPhi - Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming
Cliques for Multi-Term Linearization of 0-1 Multilinear Program for Boolean Logical Pattern Generation
A Population-Based Stochastic Coordinate Descent Method
Low-Rank Matrix Recovery with Ky Fan 2-k-Norm
Typed Lambda Calculi and Applications, Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, UK, April 10-12, 1995, Proceedings
Dependent Types for Nominal Terms with Atom Substitutions
Classical Call-by-Need and Duality
Linear Lambda Calculus and Deep Inference
Monotonic versus Antimonotonic Exponentation
The Coordination Language Facility and Applications
A Simple Adequate Categorical Model for PCF
Parallel Implementation Models for the lambda-Calculus Using the Geometry of Interaction
The [triangle]-Calculus. Functional Programming with Higher-Order Encodings
Termination and Productivity Checking with Continuous Types
Logical Predicates for Intuitionistic Linear Type Theories
Second-Order Pre-Logical Relations and Representation Independence
The Omega Rule is P 1 1 -Complete in the lambdabeta -Calculus
Partial Orders, Event Structures and Linear Strategies
Undecidability of Equality in the Free Locally Cartesian Closed Category
A Pronominal Approach to Binding and Computation
Wild omega-Categories for the Homotopy Hypothesis in Type Theory
Pure Type Systems Formalized
Typing Lambda Terms in Elementary Logic with Linear Constraints
Binding Signatures for Generic Contexts
Rank-2 Intersection and Polymorphic Recursion
Inductive Definitions in the system Coq - Rules and Properties
Functional In-Place Update with Layered Datatype Sharing
Multi-Focusing on Extensional Rewriting with Sums
Using Models to Model-Check Recursive Schemes
A Simple Calculus of Exception Handling
System F i
An explicit Eta rewrite rule
A Logical Foundation for Environment Classifiers
Proving with Side Effects
Semantic Cut Elimination in the Intuitionistic Sequent Calculus
Typed Operational Semantics
Completeness of Conversion between Reactive Programs for Ultrametric Models
Max-Plus Quasi-interpretations
On Mints' Reduction for ccc-Calculus
The Complexity of beta-Reduction in Low Orders
The Elimination of Nesting in SPCF
The Inconsistency of a Brouwerian Continuity Principle with the Curry-Howard Interpretation
The Finitely Generated Types of the lambda-Calculus
Subtyping Recursive Games
Total Functionals and Well-Founded Strategies
Basic Properties of Data Types with Inequational Refinements
Simple Saturated Sets for Disjunction and Second-Order Existential Quantification
From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour
Categorical completeness results for the simply-typed lambda-calculus
A Feasible Algorithm for Typing in Elementary Affine Logic
A Verified Typechecker
The Inhabitation Problem for Rank Two Intersection Types
Strict Functionals for Termination Proofs
Practical Inference for Type-Based Termination in a Polymorphic Setting
A Constructive Model of Uniform Continuity
Characterizing Convergent Terms in Object Calculi via Intersection Types
Elementary Complexity and Geometry of Interaction
Inhabitation in Typed Lambda-Calculi (A Syntactic Approach)
Tree Automata, (Dis-)Equality Constraints and Term Rewriting - What's New?
A Lambda-to-CL Translation for Strong Normalization
Parameterizations and Fixed-Point Operators on Control Categories
Combining Recursive and Dynamic Types
Categorical Semantics of Control
Edifices and Full Abstraction for the Symmetric Interaction Combinators
Avoiding Equivariance in Alpha-Prolog
Convolution λ̅μ-Calculus
Higher-Order Logic Programming Languages with Constraints: A Semantics
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable
Derivatives of Containers
Decidable Properties of Intersection Type Systems
A Finitary Subsystem of the Polymorphic lambda-Calculus
Lambda-Calculi with Conditional Rules
Call-by-Value and Nondeterminism
Proof-Relevant Logical Relations for Name Generation
Quantitative Semantics Revisited
Non-determinism, Non-termination and the Strong Normalization of System T
Orthogonal Higher-Order Rewrite Systems are Confluent
Reductions, Intersection Types, and Explicit Substitutions
A Substructural Type System for Delimited Continuations
Higher-Order Abstract Syntax in Coq
Typed Lambda Calculi and Applications, 11th International Conference, TLCA 2013, Eindhoven, The Netherlands, June 26-28, 2013. Proceedings
Logical Reconstruction of Bi-domains
Game Semantics for the Pure Lazy lambda-calculus
Can Proofs Be Animated By Games?
Relating Classical Realizability and Negative Translation for Existential Witness Extraction
Counting a Type's Principal Inhabitants
A Logic for Parametric Polymorphism
A Sound and Complete CPS-Translation for lambda-mu-Calculus
A Survey of Classical Realizability
Inductive Types in the Calculus of Algebraic Constructions
Finite Combinatory Logic with Intersection Types
Characterising Explicit Substitutions which Preserve Termination
Principal Typing in Elementary Affine Logic
Intersection Type Matching with Subtyping
On the Values of Reducibility Candidates
Weak and Strong Beta Normalisations in Typed Lambda-Calculi
Session-Based Communication Optimisation for Higher-Order Mobile Processes
A Module Calculus for Pure Type Systems
The Undecidability of Typability in the Lambda-Pi-Calculus
Coinductive Axiomatization of Recursive Type Equality and Subtyping
Game Semantics for Untyped lambda beta eta -Calculus
Modified Realizability Toposes and Strong Normalization Proofs
Abstraction Barrier-Observing Relational Parametricity
Thick Subtrees, Games and Experiments
Extracting Text from Proofs
Nondeterministic Light Logics and NP-Time
Schwichtenberg-Style Lambda Definability Is Undecidable
Existential Type Systems with No Types in Terms
Relational Reasoning in a Nominal Semantics for Storage
The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories
Initial Algebra Semantics Is Enough!
Continuity and Discontinuity in Lambda Calculus
Third-Order Matching in the Presence of Type Constructors
Typed Lambda Calculi and Applications, International Conference on Typed Lambda Calculi and Applications, TLCA '93, Utrecht, The Netherlands, March 16-18, 1993, Proceedings
Rewriting in Practice
A Simple Model for Quotient Types
Typed Lambda Calculi and Applications, 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings
Reducibility and TT-Lifting for Computation Types
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi
A Universal Embedding for the Higher Order Structure of Computational Effects
Recursive Types Are not Conservative over F
Comparing Lambda-calculus translations in Sharing Graphs
Intersection Types and Bounded Polymorphism
A Logical Framework with Dependently Typed Records
Polarized Proof Nets with Cycles and Fixpoints Semantics
Orthogonality and Boolean Algebras for Deduction Modulo
Final Semantics for untyped lambda-calculus
Böhm's Theorem for Resource Lambda Calculus through Taylor Expansion
Intuitionistic Refinement Calculus
Translating Dependent Type Theory into Higher Order Logic
Games and Weak-Head Reduction for Classical PCF
Polynomial Time in the Parametric Lambda Calculus
The Conservation Theorem revisited
Lambda calculus characterizations of poly-time
Untyped lambda-Calculus with Relative Typing
Realizability for Peano Arithmetic with Winning Conditions in HON Games
Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves
A Lambda Calculus for Quantum Computation with Classical Control
A realization of the negative interpretation of the Axiom of Choice
Outermost-Fair Rewriting
Call-by-Name and Call-by-Value as Token-Passing Interaction Nets
Parametricity for Haskell with Imprecise Error Semantics
Using Subtyping in Program Optimization
An Abstract Notion of Application
Pomset Logic: A Non-commutative Extension of Classical Linear Logic
Extensions of Pure Type Systems
Definability of Total Objects in PCF and Related Calculi
On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic
ßn-Equality for Coproducts
Ramified Recurrence with Dependent Types
Predicative Analysis of Feasibility and Diagonalization
Mathematical Synthesis of Equational Deduction Systems
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
Refinement Types as Proof Irrelevance
Logical Properties of Name Restriction
On Strong Normalization in the Intersection Type Discipline
Multivariate Amortised Resource Analysis for Term Rewrite Systems
The Safe Lambda Calculus
Extracting Constructive Content from Classical Logic via Control-like Reductions
Lexicographic Path Induction
A Study of Abramsky's Linear Chemical Abstract Machine
A Type Theoretical View of Böhm-Trees
Conservativity of Embeddings in the lambda Pi Calculus Modulo Rewriting
Program Extraction from Normalization Proofs
Realizability Toposes from Specifications
Explicitly Typed lambda µ -Calculus for Polymorphism an Call-by-Value
Names, Equations, Relations: Practical Ways to Reason about new
Proof Nets, Garbage, and Computations
Initial Algebra Semantics for Cyclic Sharing Structures
Eta-Expansions in Dependent Type Theory - The Calculus of Constructions
What is a Categorical Model of Intuitionistic Linear Logic?
A Formalization of the Strong Normalization Proof for System F in LEGO
Mixin Composition Synthesis Based on Intersection Types
Minimum Information Code in a Pure Functional Language with Data Types
Induction Is Not Derivable in Second Order Dependent Type Theory
Polarized Proof-Nets: Proof-Nets for LC
Typed Lambda Calculi and Applications - 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings
Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings
Ludics is a Model for the Finitary Linear Pi-Calculus
Call-by-Push-Value: A Subsuming Paradigm
Differential Linear Logic and Polarization
Kripke Semantics for Martin-Löf's Extensional Type Theory
Privacy in Data Mining Using Formal Methods
Strong Normalisation of Cut-Elimination in Classical Logic
A Token Machine for Full Geometry of Interaction
Lambda-calculus, Combinators and the Comprehension Scheme
Higher-Order Dynamic Pattern Unification for Dependent Types and Records
Syntax for Free: Representing Syntax with Binding Using Parametricity
A Term Calculus for Intuitionistic Linear Logic
Fibrations of Tree Automata
Typed Intermediate Languages for Shape Analysis
Lower and Upper Bounds for Reductions of Types in Lambda-omega and Lambda-P
Partially Additive Categories and Fully Complete Models of Linear Logic
Strong Normalization of Classical Natural Deduction with Disjunction
An Inference Algorithm for Strictness
Elementary Affine Logic and the Call-by-Value Lambda Calculus
The Cut-Elimination Theorem for Differential Nets with Promotion
Non-linearity as the Metric Completion of Linearity
The Implicit Calculus of Constructions
Relative Definability and Models of Unary PCF
Every Unsolvable lambda Term has a Decoration
Weakly Distributive Domains
Homotopy-Theoretic Models of Type Theory
Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ -Calculus
Termination of Dependently Typed Rewrite Rules
Primitive Recursion for Higher-Order Abstract Syntax
Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types
Typed Lambda Calculi and Applications, 8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings
Computation by Prophecy
Observability for Pair Pattern Calculi
Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001, Proceedings
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
On a Semantic Definition of Data Independence
Partial Intersection Type Assignment in Applicative Term Rewriting Systems
Generalizations of Hedberg's Theorem
Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic
Partiality, State and Dependent Types
Bounded Linear Logic, Revisited
An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in "Natural Deduction" Form
Well-Going Programs Can Be Typed
Recursive Functions with Higher Order Domains
Weak omega-Categories from Intensional Type Theory
Parigot's Second Order lambda-mu-Calculus and Inductive Types
Consequences of Jacopini's Theorem: Consistent Equalities and Equations
Explicit Environments
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
Controlling Program Extraction in Light Logics
Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for Lambda-calculi
Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1
Useless-Code Detection and Elimination for PCF with Algebraic Data types
Standardization of a Call-By-Value Lambda-Calculus
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract
A Finite Axiomatization of Inductive-Recursive Definitions
Combining Proofs and Programs
Curry-Howard for Sequent Calculus at Last!
A Fully Abstract Translation between a Lambda-Calculus with Reference Types and Standard ML
Resource Interpretations, Bunched Implications and the alpha lambda -Calculus
Type reconstruction in F-omega is undecidable
A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation
Polynomial Size Analysis of First-Order Functions
Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming - (Extended Abstract)
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings
Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars
Non-Constructivity in Kan Simplicial Sets
Subtyping Recursive Types Modulo Associative Commutative Products
Filters on CoInductive Streams, an Application to Eratosthenes' Sieve
Deciding Monadic Theories of Hyperalgebraic Trees
A Logic for Abstract Data Types as Existential Types
Complexity of Gödel's T in lambda-Formulation
Two Session Typing Systems for Higher-Order Mobile Processes
Proof Contexts with Late Binding
Modules in Non-communicative Logic
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs
Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction
Lambda Definability with Sums via Grothendieck Logical Relations
Typed lambda-calculi with explicit substitutions may not terminate
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
Typed Lambda Calculi and Applications, Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings
Combining First and Higher Order Rewrite Systems with Type Assignment Systems
A Proof-theoretic Characterization of Independence in Type Theory
Higher-Order Abstract Non-interference
Strong Normalization and Equi-(Co)Inductive Types
The Resource Lambda Calculus Is Short-Sighted in Its Relational Model
AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem
An Elementary Affine λ -Calculus with Multithreading and Side Effects
Normalization by Evaluation for the Computational Lambda-Calculus
Observational Equivalence and Program Extraction in the Coq Proof Assistant
Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus
A Curry-Howard Isomorphism for Compilation and Program Execution
Expanding Extensional Polymorphism
Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts
An Isomorphism Between Cut-Elimination Procedure and Proof Reduction
Categorical semantics of the call-by-value lambda-calculus
Completeness Theorems and lambda-Calculus
Naming Proofs in Classical Propositional Logic
Type-Directed Compilation in the Wild: Haskell and Core
Matching Constraints for the Lambda Calculus of Objects
Retracts in Simple Types
Natural Deduction for Intuitionistic Non-communicative Linear Logic
L 3 : A Linear Language with Locations
Small Induction Recursion
MALL Proof Equivalence is Logspace-Complete, via Binary Decision Diagrams
Encoding of the Halting Problem into the Monster Type & Applications
Logical Relations for Coherence of Effect Subtyping
13th International Conference on Typed Lambda Calculi and Applications, TLCA 2015, Warsaw, Poland, July 1-3, 2015
An Axiomatic System of Parametricity
Pure Type Systems with Subtyping
A Model for Formal Parametric Polymorphism: A PER Interpretation for System R
Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings
Algebraic Totality, towards Completeness
Completing Herbelin's Programme
On Interaction, Continuations and Defunctionalization
On Equivalence Classes of Interpolation Equations
Inhabitation of Low-Rank Intersection Types
Well-Founded Recursion over Contextual Objects
Galois Embedding from Polymorphic Types into Existential Types
A Semantics for Lambda&-early: A Calculus with Overloading and Early Binding
Semantics of lambda-I and of other substructure lambda calculi
Representations of First Order Function Types as Terminal Coalgebras
A New Characterization of Lambda Definability
Evolving Games and Essential Nets for Affine Polymorphism
A Simplification of Girard's Paradox
Soundness of the Logical Framework for Its Typed Operational Semantics
A Fully Abstract Bidomain Model of Unary FPC
Studying the Fully Abstract Model of PCF within its Continuous Function Model
A Filter Model for the λμ -Calculus - (Extended Abstract)
Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics
Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq
An Arithmetical Proof of the Strong Normalization for the lambda -Calculus with Recursive Equations on Types
The Stratified Foundations as a Theory Modulo
On the Meaning of Logical Completeness
Extensional Rewriting with Sums
On a Logical Foundation for Explicit Substitutions
Models for Polymorphism over Physical Dimension
Computational Reflection in the Calculus of Constructions and its Application to Theorem Proving
A Deconstruction of Non-deterministic Classical Cut Elimination
Realizability Proof for Normalization of Full Differential Linear Logic
Sequentiality and the pi-Calculus
A Polymorphic Type System for the Lambda-Calculus with Constructors
SoK: A Systematic Literature Review of Bluetooth Security Threats and Mitigation Measures
Emerging Information Security and Applications - Third International Conference, EISA 2022, Wuhan, China, October 29-30, 2022, Proceedings
Emerging Information Security and Applications - Second International Symposium, EISA 2021, Copenhagen, Denmark, November 12-13, 2021, Revised Selected Papers
Hierarchical Identity Based Inner Product Functional Encryption for Privacy Preserving Statistical Analysis Without q-type Assumption
Chinese Named Entity Recognition Within the Electric Power Domain
Towards Low-Latency Big Data Infrastructure at Sangfor
NEEX: An Automated and Efficient Tool for Detecting Browser Extension Fingerprint
A Two-Fold Study to Investigate Users' Perception of IoT Information Sensitivity Levels and Their Willingness to Share the Information
Enhancing Chinese Named Entity Recognition with Disentangled Expert Knowledge
Asymmetric Secure Multi-party Signing Protocol for the Identity-Based Signature Scheme in the IEEE P1363 Standard for Public Key Cryptography
Toward the Tradeoffs Between Privacy, Fairness and Utility in Federated Learning
Privacy-Preserving Authenticated Federated Learning Scheme for Smart Healthcare System
JSLIM: Reducing the Known Vulnerabilities of JavaScript Application by Debloating
Deep Neural Network Model over Encrypted Data
An Efficient Federated Convolutional Neural Network Scheme with Differential Privacy
Emerging Information Security and Applications - 4th International Conference, EISA 2023, Hangzhou, China, December 6-7, 2023, Proceedings
Digital Twin Monitoring for Cyber-Physical Access Control
Parallel Validity Analysis of the Boomerang Attack Model
Towards Efficient Universal Adversarial Attack on Audio Classification Models: A Two-Step Method
Adversarial Example Attacks and Defenses in DNS Data Exfiltration
AutoRoC-DBSCAN: Automatic Tuning of DBSCAN to Detect Malicious DNS Tunnels
PtbStolen: Pre-trained Encoder Stealing Through Perturbed Samples
Improving Host-Based Intrusion Detection Using Thread Information
Pairing Compression on Some Elliptic Curves with Subgroups of Embedding Degree 6 and Its Applications to Pairing-Based Cryptography
A Multi-task Mobile Crowdsensing Scheme with Conditional Privacy Preserving for Vehicle Networks
CONNECTION: COvert chaNnel NEtwork attaCk Through bIt-rate mOdulatioN
AMLChain: Supporting Anti-money Laundering, Privacy-Preserving, Auditable Distributed Ledger
Practical and Provable Secure Vehicular Component Protection Scheme
Database Intrusion Detection Systems (DIDs): Insider Threat Detection via Behaviour-Based Anomaly Detection Systems - A Brief Survey of Concepts and Approaches
A Survey on Discrete Gaussian Samplers in Lattice Based Cryptography
Link Aware Aggregation Query with Privacy-Preserving Capability in Wireless Sensor Networks
Differential Cryptanalysis of Lightweight Block Ciphers SLIM and LCB
D2CDIM: DID-Based Decentralized Cross-Domain Identity Management with Privacy-Preservation and Sybil-Resistance
APHC: Auditable and Privacy Preserving Health QR Code Based on Blockchain
HBMD-FL: Heterogeneous Federated Learning Algorithm Based on Blockchain and Model Distillation
A Systematic Method for Constructing ICT Supply Chain Security Requirements
Secure and Efficient Certificateless Authentication Key Agreement Protocol in VANET
Granularity and Usability in Authorization Policies
Design of Hysteresis Control based Adaptive Sliding Mode Control and Cuckoo Search based PI Control for DC-DC Boost Converters