AbstractWe present method for compiling pattern matching on lazy languages based on previous work by Laville, Huet and Lévy. It consists of coding ambiguous linear sets of patterns using "Term Decomposition," and producing non ambiguous sets over terms with structural constraints on variables. The method can also be applied to strict language giving a match algorithm that include only unavoidable tests when such as algorithm exists
This paper describes the automatic derivation of compiled patterns and of a pattern compiler by part...
Abstract. LFC is a functional language based on recursive functions defined on context-free language...
Dependent pattern matching is a safe and efficient way to write programs and proofs in dependently t...
AbstractWe present method for compiling pattern matching on lazy languages based on previous work by...
this paper we take a more direct approach: we compile pattern matching on overlapping patterns. We f...
We examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches. We state...
A constrained term pattern s:phi represents the language of all instances of the term s satisfying t...
A constrained term pattern s:¿ represents the language of all instances of the term s satisfying the...
Abstract: Motivated by the promotion of rewriting techniques and their use in major industrial appli...
We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of...
AbstractThis paper formally describes and studies an algorithm for compiling functions defined throu...
A term rewrite system is used to specify a pattern matcher in a code generator. The pattern matcher ...
This paper provides a complete solution to that second challenge. In particular, the well-known (and...
Pattern matching is the act of checking if a value is in the set of values described by a pattern. M...
Abstract. We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanis...
This paper describes the automatic derivation of compiled patterns and of a pattern compiler by part...
Abstract. LFC is a functional language based on recursive functions defined on context-free language...
Dependent pattern matching is a safe and efficient way to write programs and proofs in dependently t...
AbstractWe present method for compiling pattern matching on lazy languages based on previous work by...
this paper we take a more direct approach: we compile pattern matching on overlapping patterns. We f...
We examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches. We state...
A constrained term pattern s:phi represents the language of all instances of the term s satisfying t...
A constrained term pattern s:¿ represents the language of all instances of the term s satisfying the...
Abstract: Motivated by the promotion of rewriting techniques and their use in major industrial appli...
We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of...
AbstractThis paper formally describes and studies an algorithm for compiling functions defined throu...
A term rewrite system is used to specify a pattern matcher in a code generator. The pattern matcher ...
This paper provides a complete solution to that second challenge. In particular, the well-known (and...
Pattern matching is the act of checking if a value is in the set of values described by a pattern. M...
Abstract. We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanis...
This paper describes the automatic derivation of compiled patterns and of a pattern compiler by part...
Abstract. LFC is a functional language based on recursive functions defined on context-free language...
Dependent pattern matching is a safe and efficient way to write programs and proofs in dependently t...
DOI
Add to ORKG