Add to ORKGAbstract. LFC is a functional language based on recursive functions defined on context-free languages. A new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become more complicated and further studies are needed
Abstract: Motivated by the promotion of rewriting techniques and their use in major industrial appli...
Frequent patterns are patterns such as sets of features or items that appear in data frequently. Fin...
This paper presents matching logic, a first-order logic (FOL) variant forspecifying and reasoning ab...
AbstractThis paper formally describes and studies an algorithm for compiling functions defined throu...
A type checking method for the functional language LFC is presented. A distinct feature of LFC is th...
The present thesis provides a systematic and detailed consideration on the embedding of fundamental ...
AbstractWe compile functional languages with pattern-matching features into interaction nets, extend...
We introduce a general framework which is suitable to capture an essence of compressed pattern match...
Abstract—A core programming language is presented that allows structural recursion over open LF obje...
This paper is devoted to the synthesis of a functional version of the Knuth-Morris-Pratt algorithm f...
AbstractWe present method for compiling pattern matching on lazy languages based on previous work by...
We examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches. We state...
Finding matches, both exact and approximate, between a sequence of symbols A and a pattern P has lon...
Abstract. We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanis...
The pattern matching calculus is a refinement of λ-calculus that integrates mechanisms appropriate f...
Abstract: Motivated by the promotion of rewriting techniques and their use in major industrial appli...
Frequent patterns are patterns such as sets of features or items that appear in data frequently. Fin...
This paper presents matching logic, a first-order logic (FOL) variant forspecifying and reasoning ab...
AbstractThis paper formally describes and studies an algorithm for compiling functions defined throu...
A type checking method for the functional language LFC is presented. A distinct feature of LFC is th...
The present thesis provides a systematic and detailed consideration on the embedding of fundamental ...
AbstractWe compile functional languages with pattern-matching features into interaction nets, extend...
We introduce a general framework which is suitable to capture an essence of compressed pattern match...
Abstract—A core programming language is presented that allows structural recursion over open LF obje...
This paper is devoted to the synthesis of a functional version of the Knuth-Morris-Pratt algorithm f...
AbstractWe present method for compiling pattern matching on lazy languages based on previous work by...
We examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches. We state...
Finding matches, both exact and approximate, between a sequence of symbols A and a pattern P has lon...
Abstract. We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanis...
The pattern matching calculus is a refinement of λ-calculus that integrates mechanisms appropriate f...
Abstract: Motivated by the promotion of rewriting techniques and their use in major industrial appli...
Frequent patterns are patterns such as sets of features or items that appear in data frequently. Fin...
This paper presents matching logic, a first-order logic (FOL) variant forspecifying and reasoning ab...