yusuke1997/dblp-id-title huggingface dataset:
Tools to aid learning reusability
Preparing students for the workforce
Student motivation and positive impressions of computing subjects
Computer & network infrastructure design, installation, maintenance and management - a proposed new competency based curriculum
Visualizing programming in recursion and linked lists
Introducing object orientation to experienced procedural programmers
Explaining issues in software reusability via an audio system analogy
Industry collaboration: a practical approach for ERP education
Educationally critical aspects of a deep understanding of the concept of an information system
Metadata for smart multimedia learning objects
Computer science in the new millennium: convergence of the technical, social and ethical
On blooming first year programming, and its blooming assessment
A smorgasbord of pedagogical dishes
Fostering interest in information technology: running a vacation school for pre-University students
Low-contact learning in a first year programming course
To Zed and back: integrating data flow diagrams and Z
Problem-based learning of first year computer science
Java meets teletubbies: an interaction between program codes and physical props
Evolutionary programming techniques for testing students' code
Computer science: through the eyes of potential students
Teaching software tools via design patterns
A CANDLE to light the way?
Separation of basic competency acquisition from advanced material in teaching and assessment in an undergraduate computing subject
Using algorithm animations to assist teaching state space search: an empirical evaluation
Teaching object-oriented development with emphasis on pattern application
Where are we? The year 2000 and computer science
Web technology as curriculum
A streamlined system for building online presentation archives using SMIL
In search of the inverse curriculum
Some experimental evidence on the educational value of interactive Java applets in Web-based tutorials
The changing curriculum of computing and information technology in Australia
Paradigms for educational research in computer science
Conveying technical content in a curriculum using problem based learning
The use of OSI as a framework for the teaching of computer communications
Time studies as a tool for (computer science) education research
Proceedings of the ACM SIGCSE 3rd Australasian Conference on Computer Science Education, ACSE 1998, The University of Queensland, Brisbane, Queensland, Australia, July 8-10, 1998
Collaborative hypermedia education with the VIENA classroom system
Automated assessment and marking of spreadsheet concepts
The dot.com generation: IT practices & skills of transition students (2000)
The evolution of a mentoring scheme for first year computer science students
Process improvement of software engineering education
Concurrency, objects and visualisation
A network model for network management teaching
Calculating first: a better curriculum?
A self-taught computer engineering course
An authentic task based computer literacy course
A cognitive model for facilitating the teaching of computer programming skills
The information environments program - a new design based IT degree
Building a rigorous research agenda into changes to teaching
Learning object-oriented programming in six hours: an experience with school students
Literate programming as an aid to marking student assignments
Assessing students to diagnose difficulties in learning various programming paradigms and languages
The design of an experiential component for a formal methods computer science subject
A non-linear, criterion-referenced grading scheme for a computer literacy course
Proceedings of the ACM SIGCSE 2nd Australasian Conference on Computer Science Education, ACSE 1997, Melbourne, Victoria, Australia, 1997
Teaching C/C++ to computer science students with pascal programming experience
What do exam results really measure?
Optimising student cognitive load in computer education
A first year advanced students' project scheme
A community and knowledge building model in computer education
Java as a teaching language - opportunities, pitfalls and solutions
Automated generation of hypertextual course material from plaintext
Business students in information systems: wizards or apprentices?
User interface design and programming for computer science majors
Teaching software evolution practice (poster session)
Undergraduate students and the management-technology interface: a multi-disciplinary education program
Integrating case studies and projects in IS management education
Problem based learning with technological support in an AI subject: description and evaluation
Integrating literate programming and cleanroom software engineering to teach software engineering skills
A teaching system for SQL
Teaching software testing
A new approach to introducing software engineering
Teaching AI algorithms using animations reinforced by interactive exercises
Methodologies for teaching new programming languages: a case study teaching LISP
Using computer generated software metrics to improve the quality of students' programs
Graphical visualisation support in a uniform environment
Effective instructional animation in 3D computer graphics education
Teaching programming to beginners - choosing the language is just the first step
Computer technology students - what skills do they really need?
A learning by doing model for teaching advanced databases
Setting up a tutor training programme in computer science
Towards literate tools for novice programmers
Teaching computer ethics: an alternative assessment approach
Multi-campus teaching using computer networks
Visible-C a simple visualisation system for C data structures
Implementing studios for experiential learning
A comparative analysis of design principles for project-based IT courses
Introducing a legal strand in the computer science curriculum
Attracting and retaining females in information technology courses
Teaching programming paradigms and languages for qualitative learning
Teaching a first-level programming course to management students: a flexible approach
Experience teaching Java: a preliminary report
Why Ada?
VisA: towards a students' green card to automata theory and formal languages
Automated testing of databases and spreadsheets - the long and the short of it
Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
Formal Design, Implementation and Verification of Blockchain Languages (Invited Talk)
On the Invariance of the Unitary Cost Model for Head Reduction
Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings
Modular Church-Rosser Modulo
General Solution of Systems of Linear Diophantine Equations and Inequations
A Homotopical Completion Procedure with Applications to Coherence of Monoids
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, Edinburgh, Scottland, UK, July 11-13, 2010
Termination of Context-Sensitive Rewriting
On the Taylor Expansion of Probabilistic lambda-terms
Structured Contextual Rewriting
Non Strict Confluent Rewrite Systems for Data-Structures with Pointers
Infinite Runs in Abstract Completion
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
Structural Interactions and Absorption of Structural Rules in BI Sequent Calculus
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems
Is it possible to unify sequential programs?
Parallel Evaluation of Interaction Nets with MPINE
Proofs in Parameterized Specification
Undecidable Properties of Syntactic Theories
Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings
Generating Polynomial Orderings for Termination Proofs
Word Problems and Confluence Problems for Restricted Semi-Thue Systems
On the Formalization of Termination Techniques based on Multiset Orderings
Goal-Directed E-Unification
The Undecidability of Type Related Problems in Type-free Style System F
Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
Design Proof Assistant (Abstract)
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
Generalizing Newman's Lemma for Left-Linear Rewrite Systems
On Gaining Efficiency in Completion-Based Theorem Proving
Confluence of Terminating Conditional Rewrite Systems Revisited
Rewriting Techniques in Theoretical Physics
First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RTA 2014, Vienna, Austria, July 13, 2014
Template Games, Simple Games, and Day Convolution
Unication Problems Modulo a Theory of Until
Feasible Trace Reconstruction for Rewriting Approximations
Predicate Abstraction of Rewrite Theories
Rewrite Systems for Integer Arithmetic
A Recursive Path Ordering for Higher-Order Terms in eta -Long beta -Normal Form
Unification in Extension of Shallow Equational Theories
The Tecton Proof System
Anti-Unification for Unranked Terms and Hedges
Reachability Analysis of Innermost Rewriting
Front Matter, Table of Contents, Preface, Steering Committee, Program Committee, External Reviewers
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting
On Proving Termination by Innermost Termination
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
On Narrowing, Refutation Proofs and Constraints
An Algorithm for Distributive Unification
Proof Orders for Decreasing Diagrams
Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion
Parallel ReDuX -> PaReDuX
Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-
Confluence of Orthogonal Nominal Rewriting Systems Revisited
TRAM: An Abstract Machine for Order-Sorted Conditioned Term Rewriting Systems
On the Completeness of Context-Sensitive Order-Sorted Specifications
Confluence by Critical Pair Analysis
An Approximation Based Approach to Infinitary Lambda Calculi
Shostak's Congruence Closure as Completion
Deciding Innermost Loops
Diagrams for Meaning Preservation
Invited Talk: Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems
Lazy Rewriting and Eager Machinery
Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk)
Unification and Narrowing in Maude 2.4
Rewriting Techniques and Applications, 2nd International Conference, RTA-87, Bordeaux, France, May 25-27, 1987, Proceedings
lambda!-calculus, Intersection Types, and Involutions
Proving Positive Almost Sure Termination Under Strategies
A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems
Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic
Homotopy Canonicity for Cubical Type Theory
Combinatorial Hypermap Rewriting
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited
A Characterization of Medial as Rewriting Rule
C i ME: Complet i on Modulo E
Nagoya Termination Tool
Pointers in Recursion: Exploring the Tropics
Saturation of First-Order (Constrained) Clauses with the Saturate System
Modularity of Convergence in Infinitary Rewriting
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
Theory Path Orderings
Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms
Finite Models vs Tree Automata in Safety Verification
Satisfying KBO Constraints
Proof Normalization for Resolution and Paramodulation
Smaran: A Congruence-Closure Based System for Equational Computations
Higher-Order Orderings for Normal Rewriting
Gluing for Type Theory
MERILL: An Equational Reasoning System in Standard ML
THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques
Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction
Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem
Certification of Complexity Proofs using CeTA
Verified Analysis of Functional Data Structures
Relating System F and Lambda2: A Case Study in Coq, Abella and Beluga
Rewrite-Based Automated Reasoning: Challenges Ahead
Decidability of Confluence and Termination of Monadic Term Rewriting Systems
Atomic Set Constraints with Projection
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
Context Unification and Traversal Equations
On Undefined and Meaningless in Lambda Definability
Efficient Second-Order Matching
Partial Inversion of Constructor Term Rewriting Systems
Program Inversion for Tail Recursive Functions
On the Word Problem for Combinators
Open. Closed. Open
A New Result about the Decidability of the Existential One-Step Rewriting Theory
Combinatorial Flows and Their Normalisation
Completion-Time Optimization of Rewrite-Time Goal Solving
Leftmost Outermost Revisited
Proof Normalisation in a Logic Identifying Isomorphic Propositions
A Parallel Implementation of Rewriting and Narrowing
Computing and Proving
Decidability and Closure Properties of Equational Tree Languages
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule.
Absolute Explicit Unification
A Criterion for Intractability of E-unification with Free Function Symbols and Its Relevance for Combination Algorithms
On (Un)Soundness of Unravelings
Proof Terms for Infinitary Rewriting
Equivariant Unification
Distributing Equational Theorem Proving
Linear Interpretations by Counting Patterns
Higher-Order Families
Prototyping Completion with Constraints Using Computational Systems
A General Complete E -Unification Procedure
Extending the Explicit Substitution Paradigm
Strict Ideal Completions of the Lambda Calculus
Continuation Passing Style for Effect Handlers
27th International Workshop on Unification, UNIF 2013, Eindhoven, Netherlands, June 26, 2013
From Higher-Order to First-Order Rewriting
Predictive Labeling
Bottom-Up Tree Pushdown Automata and Rewrite Systems
Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes
Rewriting Logic and Probabilities
Conditions for Efficiency Improvement by Tree Transducer Composition
Dealing with Non-orientable Equations in Rewriting Induction
Underspecified computation of normal forms
Computing Connected Proof(-Structure)s From Their Taylor Expansion
Simple Termination is Difficult
Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism
The Maximum Length of Mu-Reduction in Lambda Mu-Calculus
Some Semantic Issues in Probabilistic Programming Languages (Invited Talk)
Finer Is Better: Abstraction Refinement for Rewriting Approximations
Inferring Lower Bounds for Runtime Complexity
Bounded Second-Order Unification Is NP-Complete
TTSLI: An Implementation of Tree-Tuple Synchronized Languages
Logics and Automata for Totally Ordered Trees
ReDuX 1.5: New Facets of Rewriting
Certified Rule Labeling
Solving Systems of Linear Diophantine Equations and Word Equations
Dual Calculus with Inductive and Coinductive Types
Polynomial Time Termination and Constraint Satisfaction Tests
RTA 2012 Proceedings Frontmatter
The Intersection Type Unification Problem
On the Power of Simple Diagrams
Refinement Types as Higher-Order Dependency Pairs
delta o! Epsilon = 1 - Optimizing Optimal lambda -Calculus Implementations
Differentials and Distances in Probabilistic Coherence Spaces
Goal-Directed Completion Using SOUR Graphs
Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E
Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List)
A Rewrite System Associated with Quadratic Pisot Units
Mechanizing Meta-Theory in Beluga (Invited Talk)
Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?
Studying Quasigroup Identities by Rewriting Techniques: Problems and First Results
Normalisation by Random Descent
Decidable and Undecidable Second-Order Unification Problems
in 2 : A Graphical Interpreter for Interaction Nets
Type Systems for the Relational Verification of Higher Order Programs (Invited Talk)
Matching of Compressed Patterns with Character-Variables
Term-Rewriting Implementation of Equational Logic Programming
Unranked Anti-Unification with Hedge and Context Variables
Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or
Abstract Modularity
Correctness of Copy in Calculi with Letrec
2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RDP 2015, Warsaw, Poland, July 2, 2015
Unique Normalization for Shallow TRS
Termination of Rewriting with Right-Flat Rules
System Description: The Dependency Pair Method
Code Generator Generation Based on Template-Driven Target Term Rewriting
Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems
The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
Combining Shostak Theories
Fast Rewriting of Symmetric Polynomials
Strong Normalization of Proof Nets Modulo Structural Congruences
Probabilistic Rewrite Strategies. Applications to ELAN
Nominal Unification from a Higher-Order Perspective
Ground Confluence Prover based on Rewriting Induction
ASSPEGIQUE: An Integrated Specification Environment
Higher-Order Rewrite Systems (Abstract)
Hierarchical Combination of Intruder Theories
On Confluence for Weakly Normalizing Systems
AC Complement Problems: Satisfiability and Negation Elimination
Redundancy Criteria for Constrained Completion
CRSX - Combinatory Reduction Systems with Extensions
Undecidability of the First Order Theory of One-Step Right Ground Rewriting
A Linear Logical Framework in Hybrid (Invited Talk)
Homogeneity Without Loss of Generality
Decidable Approximations of Sets of Descendants and Sets of Normal Forms
Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation
Deriving Focused Lattice Calculi
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
A Heterogeneous Pushout Approach to Term-Graph Transformation
Deciding Confluence of Ground Term Rewrite Systems in Cubic Time
Term Rewriting Systems with Priorities
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
Loops of Superexponential Lengths in One-Rule String Rewriting
Standardization and Confluence for a Lambda Calculus with Generalized Applications
Order-Sorted Unification with Regular Expression Sorts
Termination and Confluence of Higher-Order Rewrite Systems
New Undecidablility Results for Finitely Presented Monoids
Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
Higher-Order (Non-)Modularity
Symbolic Model Checking of Infinite-State Systems Using Narrowing
A Lambda-Calculus with Constructors
On Linear Combinations of lambda -Terms
Combination of Constraint Solving Techniques: An Algebraic POint of View
Morphocompletion for One-Relation Monoids
Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems
Compression of Rewriting Systems for Termination Analysis
Narrowing and Unification in Functional Programming - An Evaluation Mechanism for Absolute Set Abstraction
Automated Complexity Analysis Based on Context-Sensitive Rewriting
Some Independent Results for Equational Unification
COMTES - An Experimental Environment for the Completion of Term Rewriting Systems
Matching with Free Function Symbols - A Simple Extension of Matching?
Automated Termination Analysis of Java Bytecode by Term Rewriting
Optimal Speedups for Parallel Pattern Matching in Trees
Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk)
Stratego: A Language for Program Transformation Based on Rewriting Strategies
ASTRE: Towards a Fully Automated Program Transformation System
Term-Graph Anti-Unification
The Structural Theory of Pure Type Systems
Modular Higher-Order E -Unification
Complexity of Acyclic Term Graph Rewriting
Transfinite Rewriting Semantics for Term Rewriting Systems
The Clocks They Are Adjunctions Denotational Semantics for Clocked Type Theory
A Generic Framework for Higher-Order Generalizations
ProTeM: A Proof Term Manipulator (System Description)
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order
The Negation Elimination from Syntactic Equational Formula is Decidable
Cubical Syntax for Reflection-Free Extensional Equality
Local Termination
Relating Two Categorial Models of Term Rewriting
Rewriting Approximations for Fast Prototyping of Static Analyzers
Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6
Associative Path Orderings
Guarded Recursion in Agda via Sized Types
Normalisation for Dynamic Pattern Calculi
Internal Universes in Models of Homotopy Type Theory
Rewrite Systems for Natural, Integral, and Rational Arithmetic
Proving Equational and Inductive Theorems by Completion and Embedding Techniques
An Experiment in Partial Evaluation: The Generation of a Compiler Generator
Relating Derivation Lengths with the Slow-Growing Hierarchy Directly
Confluence Competition 2018
Modular Focused Proof Systems for Intuitionistic Modal Logics
Completion for Multiple Reduction Orderings
Concurrent Garbage Collection for Concurrent Rewriting
Some Undecidable Termination Problems for Semi-Thue Systems (Abstract)
Infinitary Rewriting: Foundations Revisited
REM (Reduce Elan Machine): Core of the New ELAN Compiler
Generalized Refocusing: From Hybrid Strategies to Abstract Machines
The Explicit Representability of Implicit Generalizations
On the Modularity of Confluence in Infinitary Term Rewriting
Towards the Average-Case Analysis of Substitution Resolution in Lambda-Calculus
The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type
Abstract Models of Transfinite Reductions
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting
Termination of Cycle Rewriting
An Overview of Rewrite Rule Laboratory (RRL)
L arrow R 2 : A Laboratory fro Rapid Term Graph Rewriting
Decidable structures between Church-style and Curry-style
Origin Tracking in Term Rewriting (Abstract)
Higher Order Dependency Pairs for Algebraic Functional Systems
lambda-µ-Calculus and Duality: Call-by-Name and Call-by-Value
RAPT: A Program Transformation System Based on Term Rewriting
24th International Conference on Rewriting Techniques and Applications, RTA 2013, Eindhoven, The Netherlands, June 24-26, 2013
Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
Over-approximating Descendants by Synchronized Tree Languages
VMTL-A Modular Termination Laboratory
Dictionary-Based Tree Compression (Invited Talk)
Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract)
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics
Liveness in Rewriting
Optimizing mkbTT
Currying Second-Order Unification Problems
An Abstract Factorization Theorem for Explicit Substitutions
Substitution Tree Indexing
Left-linear Bounded TRSs are Inverse Recognizability Preserving
Structural Proof Theory as Rewriting
Autowrite: A Tool for Checking Properties of Term Rewriting Systems
Hierarchical Combination of Unication Algorithms (Extended Abstract)
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
Network Rewriting II: Bi- and Hopf Algebras
Sequence Types for Hereditary Permutators
Rewrite Techniques in Theorem Proving (Abstract)
A Certified AC Matching Algorithm
Normalization of Infinite Terms
Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification
A de Bruijn Notation for Higher-Order Rewriting
Unification with Singleton Tree Grammars
Executable Formal Models in Rewriting Logic (Invited Talk)