The Undecidability of Third Order Pattern Matching in Calculi with Dependent Types or Type Constructors

09/21/2023
by   Gilles Dowek, et al.
0

We prove the undecidability of the third order pattern matching problem in typed lambda-calculi with dependent types and in those with type constructors by reducing the second order unification problem to them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2017

A Type Checking Algorithm for Higher-rank, Impredicative and Second-order Types

We study a type checking algorithm that is able to type check a nontrivi...
research
06/09/2023

The Undecidability of Pattern Matching in Calculi where Primitive Recursive Functions are Representable

We prove that the pattern matching problem is undecidable in polymorphic...
research
03/29/2021

A simpler encoding of indexed types

In functional programming languages, generalized algebraic data types (G...
research
09/15/2022

A case for DOT: Theoretical Foundations for Objects With Pattern Matching and GADT-style Reasoning

Many programming languages in the OO tradition now support pattern match...
research
02/08/2022

A second-order Magnus-type integrator for evolution equations with delay

We rewrite abstract delay equations to nonautonomous abstract Cauchy pro...
research
09/27/2017

A Permission-Dependent Type System for Secure Information Flow Analysis

We introduce a novel type system for enforcing secure information flow i...
research
05/31/2019

A Role for Dependent Types in Haskell (Extended version)

Modern Haskell supports zero-cost coercions, a mechanism where types tha...

Please sign up or login with your details

Forgot password? Click here to reset