yusuke1997/dblp-id-title huggingface dataset:
Reduction System for Extensional Lambda-mu Calculus
Completeness of Tree Automata Completion
Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference
Normalized Completion Revisited
Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus
Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, Proceedings
Scott's Conjecture is True, Position Sensitive Weights
Rho-Calculi for Computation and Logic (Invited Talk)
Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories
Proving Productivity in Infinite Data Structures
A Semantic Approach to Order-Sorted Rewriting
On the Correctness of Bubbling
A Simple Proof That Super-Consistency Implies Cut Elimination
Size-Change Termination for Term Rewriting
Computationally Equivalent Elimination of Conditions
A Sequent Calculus for a Semi-Associative Law
A Case Study of Completion Modulo Distributivity and Abelian Groups
A Coinductive Confluence Proof for Infinitary Lambda-Calculus
Automatic Termination
Termination of Associative-Commutative Rewriting by Dependency Pairs
On some Algorithmic Problems for Groups and Monoids
List Objects with Algebraic Structure
Unification Problems with One-Sided Distributivity
Weakening the Axiom of Overlap in Infinitary Lambda Calculus
HOL- lambdasigma : An Intentional First-Order Expression of Higher-Order Logic
Two Applications of Equational Theories to Database Theory
Rewriting for Deduction and Verification
Program Transformation and Rewriting
Confluence and Superdevelopments
A Termination Ordering for Higher Order Rewrite System
Innocuous Constructor-Sharing Combinations
Termination of Constructor Systems
Unification in a Class of Permutative Theories
Combining Decision Procedures for Positive Theories Sharing Constructors
Parallelism Constraints
Model Checking Strategy-Controlled Rewriting Systems (System Description)
Monadic Second-Order Unification Is NP-Complete
Maximal Termination
Optimal Normalization in Orthogonal Term Rewriting Systems
Open Problems in Rewriting
Tyrolean Termination Tool
Improving Basic Narrowing Techniques
Detecting Looping Simplifications
Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings
Term Rewriting in Contemporary Resolution Theorem Proving (Abstract)
Confluence by Decreasing Diagrams
Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction
General Recursion on Second Order Term Algebras
Problems in Rewriting III
Modularity of Termination Using Dependency pairs
Incremental Termination Proofs and the Length of Derivations
Inverse Unfold Problem and Its Heuristic Solving
Certified Higher-Order Recursive Path Ordering
On the Property of Preserving Regularity for String-Rewriting Systems
A Weak Calculus with Explicit Operators for Pattern Matching and Substitution
Interaction Automata and the ia2d Interpreter
Is the Optimal Implementation Inefficient? Elementarily Not
Modular Specification of Monads Through Higher-Order Presentations
Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings
Infinitary Lambda Calculi and Böhm Models
On Termination of Higher-Order Rewriting
Verifying Optimizations for Concurrent Programs
Union of Equational Theories: An Algebraic Approach
A Fully Abstract Semantics for Constructor Systems
Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings
Loops under Strategies
Closure of Hedge-Automata Languages by Hedge Rewriting
A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order
Unification of Higher-Order patterns in a Simply Typed Lambda-Calculus with Finite Products and terminal Type
Strategy-Controlled Reduction and Narrowing
Characterization of Unification Type Zero
2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, Oxford, UK, September 3-9, 2017
Dependency Pairs for Equational Rewriting
Polymorphic Higher-Order Termination
Quantitative Semantics for Probabilistic Programming (Invited Talk)
Equational Prover of THEOREMA
Head reduction and normalization in a call-by-value lambda-calculus
Intruders with Caps
Proving Innermost Normalisation Automatically
Structural Rewriting in the pi-Calculus
Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities
Transforming Cycle Rewriting into String Rewriting
A Terminating and Confluent Linear Lambda Calculus
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable
Inductive Theorems for Higher-Order Rewriting
TPA: Termination Proved Automatically
Relating Graph and Term Rewriting via Böhm Models
Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems
Observing Success in the Pi-Calculus
The CL-Atse Protocol Analyser
Unifying Nominal Unification
A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names
On the Complexity of Higher-Order Matching in the Linear lambda-Calculus
On the Correctness of a Distributed Memory Gröbner basis Algorithm
Term Rewriting Systems as Topological Dynamical Systems
On the Word Problem for Free Lattices
Displayed Categories
Algorithmic Complexity of Term Rewriting Systems
Compilation of Ground Term Rewriting Systems and Applications
Abstract Datatypes for Real Numbers in Type Theory
Termination of Simply Typed Term Rewriting by Translation and Labelling
Automated Termination Proofs with AProVE
Higher-Order Rewriting and Partial Evaluation
Deriving Focused Calculi for Transitive Relations
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
Effectively Checking the Finite Variant Property
Polynomial Running Times for Polynomial-Time Oracle Machines
Detecting Modular ACU Structural Symmetries
Goal Directed Strategies for Paramodulation
Unnesting of Copatterns
Fairness in Term Rewriting Systems
A Curry-Howard Approach to Church's Synthesis
Guiding Term Reduction Through a Neural Network: Some Prelimanary Results for the Group Theory
A Narrowing-Based Theorem Prover
A Semantic Proof that Reducibility Candidates entail Cut Elimination
Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems
Typed Equivalence of Effect Handlers and Delimited Control
Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms
On the Exponent of Periodicity of Minimal Solutions of Context Equation
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk)
Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL
A Model of Countable Nondeterminism in Guarded Type Theory
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols
Automatic Evaluation of Context-Free Grammars (System Description)
Efficient Reductions with Director Strings
An Overview of LP, The Larch Power
Basic Features and Development of the Critical-Pair/Completion Procedure
Non-Omega-Overlapping TRSs are UN
A faithful encoding of programmable strategies into term rewriting systems
A Decidable Variant of Higher Order Matching
Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars
An Algebraic Approch to Unification Under Assoiativity and Commutativity
Towards an Efficient Construction of Test Sets for Deciding Ground Reducability
Random Descent
Higher-Order Narrowing with Definitional Trees
Simultaneous Critical Pairs and Church-Rosser Property
NARROWER: A New Algorithm for Unification and Its Application to Logic Programming
Two-Dimensional Rewriting
Reduction Under Substitution
Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Nomalisation
Proving Positive Almost-Sure Termination
Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
Normalization of S-Terms is Decidable
Higher-order Unification with Dependent Function Types
Generating Tables for Bottom-Up Matching
An On-line Problem Database
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling
A Syntax for Higher Inductive-Inductive Types
Towards Modelling Actor-Based Concurrency in Term Rewriting
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
26th International Conference on Rewriting Techniques and Applications, RTA 2015, Warsaw, Poland, June 29 - July 1, 2015
Partial Order Infinitary Term Rewriting and Böhm Trees
A Unifying Framework for Type Inhabitation
Algorithms and Reductions for Rewriting Problems
A Gap Between Linear and Non Linear Term-Rewriting Systems (1)
InvX: An Automatic Function Inverter
Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings
On Proving Properties of Completion Strategies
Delayed Substitutions
"Term Partition" for Mathematical Induction
Recursively Defined Tree Transductions
Computational Real Algebraic Geometry in Practice (Invited Talk)
Construction of Retractile Proof Structures
Conditional Confluence (System Description)
Nominal Narrowing
Proving Correctness of Logically Decorated Graph Rewriting Systems
Confluence by Decreasing Diagrams - Formalized
Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms
Completion for Rewriting Modulo a Congruence
Self Types for Dependently Typed Lambda Encodings
An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras
On Computing Reachability Sets of Process Rewrite Systems
A Local Termination Property for Term Rewriting Systems
Streett Automata Model Checking of Higher-Order Recursion Schemes
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
Higher-Order Rewriting
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
First-Order Unification on Compressed Terms
Rewriting for Fitch Style Natural Deductions
Boolean Algebra Admits No Convergent Term Rewriting System
Improving Transformation Systems for General E -Unification
Modular and Certified Semantic Labeling and Unlabeling
Type Preservation as a Confluence Problem
Revisiting Matrix Interpretations for Proving Termination of Term Rewriting
A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
On Implementation of Tree Synchronized Languages
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
Towards Automated Termination Proofs through "Freezing"
Proving non-termination by finite automata
Localized Fairness: A Rewriting Semantics
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
Automatic Termination Proofs With Transformation Orderings
SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories
Reversible Term Rewriting
A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4
Linear Logic and Strong Normalization
Tree Automata for Non-linear Arithmetic
Opal: A System for Computing Noncommutative Gröbner Bases
Matching Logic - Extended Abstract (Invited Talk)
Confluence of nearly orthogonal infinitary term rewriting systems
Hilbert's Tenth Problem in Coq
Coherence for Sharing Proof Nets
KBlab: An Equational Theorem Prover for the Macintosh
A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems
Natural Narrowing for General Term Rewriting Systems
Co-definite Set Constraints
Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems
Regular Path Expression in Feature Logic
Unique perfect matchings and proof nets
Algebraic Semantics and Complexity of Term Rewriting Systems
Formal Verification of Infinite State Systems Using Boolean Methods
One-context Unification with STG-Compressed Terms is in NP
Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence
Rewriting-based Quantifier-free Interpolation for a Theory of Arrays
Compositional Compiler Verification for a Multi-Language World
Computing Ground Reducability and Inductively Complete Positions
Reduce the Redex -> ReDuX
Bottom-Up Rewriting Is Inverse Recognizability Preserving
Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency
Extending Maximal Completion (Invited Talk)
Solving Disequations Modulo Some Class of Rewrite Systems
Refutation of Sallé's Longstanding Conjecture
Contextual Rewriting
Intruder Deduction for AC -Like Equational Theories with Homomorphisms
Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
Polynomially Bounded Matrix Interpretations
Fair Termination is Decidable for Ground Systems
Fine-Grained Concurrent Completion
Fast Knuth-Bendix Completion: Summary
YAPA: A Generic Tool for Computing Intruder Knowledge
More Problems in Rewriting
A Fully Syntactic AC-RPO
23rd International Conference on Rewriting Techniques and Applications, RTA 2012, Nagoya, Japan, May 28 - June 2, 2012
Matrix Interpretations on Polyhedral Domains
Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings
Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings
A Rewriting Framework for Activities Subject to Regulations
Closing the Gap Between Runtime Complexity and Polytime Computability
TOY : A Multiparadigm Declarative System
On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
Confluence Properties of Extensional and Non-Extensional lambda -Calculi with Explicit Substitutions (Extended Abstract)
Automated Certified Proofs with CiME3
Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification
Dummy Elimination in Equational Rewriting
An Analytic Tableau System for Natural Logic
Concealed Questions with Quantifiers
Rivalry between French - age and - ée : The Role of Grammatical Aspect in Nominalization
Affective Demonstratives and the Division of Pragmatic Labor
Pragmatic Constraints on Gesture Use: The Effect of Downward and Non Entailing Contexts on Gesture Processing
When Disjunction Looks Like Conjunction: Pragmatic Consequences in ASL
Donkey Anaphora in Sign Language I: E-Type vs. Dynamic Accounts
Tropes, Intensional Relative Clauses, and the Notion of a Variable Object
On Wh-Exclamatives and Noteworthiness
Focus, Uniqueness and Soft Presupposition Triggers
A Logic for Easy Linking Semantics
You Again: How Is Its Ambiguity Derived?
Much Support and More
Meaning of 'Now' and Other Temporal Location Adverbs
Only Only? An Experimental Window on Exclusiveness
Degree Modification and Intensification in American Sign Language Adjectives
The Accommodation Potential of Implicative Verbs
Inquisitive Knowledge Attribution and the Gettier Problem
Formal Indices and Iconicity in ASL
The Data Complexity of the Syllogistic Fragments of English
Temporal Propositions as Vague Predicates
Empirical Evidence for Embodied Semantics
On Scales, Salience and Referential Language Use
Local and Global Implicatures in Wh -Question Disjunctions
The Semantics of Count Nouns
NL from Logic: Connecting Entailment and Generation
Natural Logic and Semantics
Adverbs of Comment and Disagreement
Vagueness Is Rational under Uncertainty
Definiteness in Superlatives
Each vs. Jeweils: A Cover-Based View on Distance Distributivity
Can Children Tell Us Something about the Semantics of Adjectives?
Cross-Categorial Donkeys
Implicit Arguments: Event Modification or Option Type Categories?
Licensing Sentence-Internal Readings in English - An Experimental Study
On the Scopal Interaction of Negation and Deontic Modals
A Theory of Names and True Intensionality
Negative Inquisitiveness and Alternatives-Based Negation
Free Choice in Deontic Inquisitive Semantics (DIS)
Specific, Yet Opaque
Polarities in Logic and Semantics
A Formal Semantics for Iconic Spatial Gestures
Processing: Free Choice at No Cost
Projective Meaning and Attachment
Internal and Interval Semantics for CP-Comparatives
On the Information Status of Appositive Relative Clauses
Focus, Evidentiality and Soft Triggers
Evaluative Adjectives, Scale Structure, and Ways of Being Polite
Supplements within a Unidimensional Semantics I: Scope
Context Probabilism
Quantificational Strategies across Language Modalities
Cumulative Readings of Every Do Not Provide Evidence for Events and Thematic Roles
Modality and Speech Acts: Troubled by German Ruhig
Disjunctive Questions, Intonation, and Highlighting
Now: A Discourse-Based Theory
Presupposition Processing - The Case of German wieder
Logic, Language and Meaning - 18th Amsterdam Colloquium, Amsterdam , The Netherlands, December 19-21, 2011, Revised Selected Papers
Adjectives as Saturators vs. Modifiers: Statistical Evidence
Exclusive Updates
Squiggly Issues: Alternative Sets, Complex DPs, and Intensionality
Multiple Foci in Japanese Clefts and the Growth of Semantic Representation
On the Non-licensing of NPIs in the Only-Focus
There Is Something about Might
Sameness, Ellipsis and Anaphora
Where Question, Conditionals and Topics Converge
Logical Consequence Inside Out
Experimental Detection of Embedded Implicatures
Two Sources of Again -Ambiguities: Evidence from Degree-Achievement Predicates
Corpus Evidence for Preference-Driven Interpretation
Obligatory Implicatures and Grammaticality
When Wide Scope Is Not Enough: Scope and Topicality of Discourse Referents
Extending Syllogistic Reasoning
Restricted Quantification over Tastes
A First-Order Inquisitive Semantics
Natural Color Categories Are Convex Sets
Modified Numerals as Post-Suppositions
Logic, Language and Meaning - 17th Amsterdam Colloquium, Amsterdam, The Netherlands, December 16-18, 2009, Revised Selected Papers
Two Puzzles about Requirements
Generalizing Monotonicity Inferences to Opposition Inferences
Underspecified Representations of Scope Ambiguity?
Pluractionality and the Unity of the Event
Restricting and Embedding Imperatives
German Noch So : Scalar Degree Operator and Negative Polarity Item
On the Semantics and Pragmatics of Dysfluency
Projective Behaviour of Nur - Quantitative Experimental Research
Equatives, Measure Phrases and NPIs
Free Choice from Iterated Best Response
Presupposition Projection Out of Quantified Sentences: Strengthening, Local Accommodation and Inter-speaker Variation
Quantifiers and Working Memory
Distributivity in Reciprocal Sentences
Some New Observations on 'Because (of)'
Steedman's Temporality Proposal and Finite Automata
Experimenting with the King of France
Vagueness Facilitates Search
Relating ERP-Effects to Theories of Belief Update and Combining Systems
vCacheShare: Automated Server Flash Cache Space Management in a Virtualization Environment
Supporting Security Sensitive Tenants in a Bare-Metal Cloud
Serving Heterogeneous Machine Learning Models on Multi-GPU Servers with Spatio-Temporal Sharing
Improving UNIX Kernel and Networking Performance Using Profile Based Optimization
A UNIX Implementation of HEMS
CrossMapping: Harmonizing Memory Consistency in Cross-ISA Binary Translation
Perspectives on NES File Server Performance Characterization
DiskSeen: Exploiting Disk Layout and Access History to Enhance I/O Prefetch
Hardware-Assisted On-Demand Hypervisor Activation for Efficient Security Critical Code Execution on Mobile Devices
Siphon: Expediting Inter-Datacenter Coflows in Wide-Area Data Analytics
3rd Workshop on I/O Virtualization, WIOV'11, Portland, OR, USA, June 14, 2011
USENIX 1995 Technical Conference on UNIX and Advanced Computing Systems, New Orleans, Louisiana, USA, January 16-20, 1995, Conference Proceedings
Between Mutual Trust and Mutual Distrust: Practical Fine-grained Privilege Separation in Multithreaded Applications
Storage Management for Web Proxies
Falcon: Scaling IO Performance in Multi-SSD Volumes
Transparent Result Caching
A New Approach to Distributed Memory Management in the Mach Microkernel
Gestalt: Fast, Unified Fault Localization for Networked Systems
USENIX Winter 1994 Technical Conference, San Francisco, California, USA, January 17-21, 1994, Conference Proceedings
A New Design for Distributed Systems: The Remote Memory Model
Accelerating Nested Virtualization with HyperTurtle
Trickle: Rate Limiting YouTube Video Streaming
NeuGraph: Parallel Deep Neural Network Computation on Large Graphs
Proceedings of the 2010 USENIX Annual Technical Conference, USENIX ATC 2010, Boston, MA, USA, June 23-25, 2010
A Transactional Memory in an Extensible Operating System
packetdrill: Scriptable Network Stack Testing, from Sockets to Packets
A Highly Available Lock Manager for HA-NFS
Coccinelle: 10 Years of Automated Evolution in the Linux Kernel
Seneca: remote mirroring done write
Reconstructing proprietary video streaming algorithms
DupHunter: Flexible High-Performance Deduplication for Docker Registries
CAB-Fuzz: Practical Concolic Testing Techniques for COTS Operating Systems
Fast Transparent Migration for Virtual Machines
A Highly Available Network File Server
WingFuzz: Implementing Continuous Fuzzing for DBMSs
Beware of Fragmentation: Scheduling GPU-Sharing Workloads with Fragmentation Gradient Descent
CacheSack: Admission Optimization for Google Datacenter Flash Caches
Explore Data Placement Algorithm for Balanced Recovery Load Distribution
Characterizing and Optimizing Remote Persistent Memory with RDMA and NVM
Demonstration: Croquet, a Networked Collaborative 3D Immersive Environment
vPath: Precise Discovery of Request Processing Paths from Black-Box Observations of Thread and Network Activities
NFS Tricks and Benchmarking Traps
Caching Doesn't Improve Mobile Web Performance (Much)
Vinter: Automatic Non-Volatile Memory Crash Consistency Testing for Full Systems
PARIX: Speculative Partial Writes in Erasure-Coded Systems
The Continuous Media File System
FetchBPF: Customizable Prefetching Policies in Linux with eBPF
FLIPC: A Low Latency Messaging System for Distributed Real Time Environments
Metadata Logging in an NFS Server
Block Management in Solid-State Devices
Are Mallocs Free of Fragmentation?
Learning Spam: Simple Techniques For Freely-Available Software
MDev-NVMe: A NVMe Storage Virtualization Solution with Mediated Pass-Through
OSI and TCP/IP Protocols on a UNIX System V
Building and Running an Open-Source Community: The FreeBSD Project
A Scalable Implementation of Virtual Memory HAT Layer for Shared Memory Multiprocessor Machines
FlashVM: Virtual Memory Management on Flash
Business Issues in Free Software Licensing
Stable and Consistent Membership at Scale with Rapid
NeuOS: A Latency-Predictable Multi-Dimensional Optimization Framework for DNN-driven Autonomous Systems
Scaling the Web of Trust: Combining Kerberos and PGP to Provide Large Scale Authentication
The X Resize and Rotate Extension - RandR
Process Labeled Kernel Profiling: A New Facility to Profile System Activities
LiveJournal's Backend Technologies
A Study of the Relative Costs of Network Security Protocols
Incl: A Tool to Analyze Include Files
Comparison-Based File Server Verification
Programmatic Orchestration of WiFi Networks
Soft Updates Made Simple and Fast on Non-volatile Memory
Satori: Enlightened Page Sharing
cHash: Detection of Redundant Compilations via AST Hashing
Network Programming for the Rest of Us
Using Read-Copy-Update Techniques for System V IPC in the Linux 2.5 Kernel
Mac OS X Tiger: What's New for UNIX Users?
Essence: A Resource Discovery System Based on Semantic File Indexing
Heuristic Cleaning Algorithms in Log-Structured File Systems
The Globe Distribution Network
The Beauty and the Beast: Vulnerabilities in Red Hat's Packages
Centralized System Monitoring with Swatch
DEcorum File System Architectural Overview