Skip to content

GitLab

  • Menu
Projects Groups Snippets
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
  • Sign in / Register
  • GHC GHC
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
    • Locked Files
  • Issues 4,866
    • Issues 4,866
    • List
    • Boards
    • Service Desk
    • Milestones
    • Iterations
  • Merge requests 458
    • Merge requests 458
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
    • Test Cases
  • Deployments
    • Deployments
    • Releases
  • Analytics
    • Analytics
    • Value stream
    • CI/CD
    • Code review
    • Insights
    • Issue
    • Repository
  • Wiki
    • Wiki
  • Snippets
    • Snippets
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • Glasgow Haskell Compiler
  • GHCGHC
  • Issues
  • #151
Closed
Open
Created Jun 13, 2003 by Simon Peyton Jones@simonpjDeveloper

Unboxed tuples as values

Consider

  type T a = Int -> (# Int, Int #)

  f :: T a -> T a
  f t = \x -> case t x of r -> r

gives the following error message:

  ghc-5.04.1: panic! (the `impossible' happened, GHC 
version 5.04.1):
	  codeGen/CgRetConv.lhs:83: Non-exhaustive 
patterns in function
	  dataReturnConvPrim

Trouble is that 'r' is bound to an unboxed tuple.  This 
should fail, but in 5.04.1 it crashes the compiler.  In 6.0 
it's worse: the code will core dump because it enters R1.

But it should be rejected in the type checker.


Trac metadata
Trac field Value
Version None
Type Bug
TypeOfFailure OtherFailure
Priority normal
Resolution ResolvedFixed
Component Compiler (Type checker)
Test case
Differential revisions
BlockedBy
Related
Blocking
CC
Operating system
Architecture
To upload designs, you'll need to enable LFS and have an admin enable hashed storage. More information
Assignee
Assign to
Time tracking