Criminal Law - Merger of Sentences: The Legislature Says You Can't Hang 'Em Twice; Najera v. State, 214 P.3d 990 (Wyo. 2009)
Alexander K. Obrecht
University of Wyoming College of Law
November 4, 2011
Wyoming Law Review, 12 Wyo. L. Rev. 141 (2012)
Historically, few constitutional protections conjured more mutated conceptions in society than double jeopardy. The United States Supreme Court holds that the Double Jeopardy Clause embodies the freedom from successive prosecution and multiple punishments for the same offense. This case note focuses on the freedom from multiple punishments, specifically post-conviction merger of sentences.
In Najera v. State, the jury convicted Najera of twelve counts of improper sexual contact with his two adopted minor daughters. Six counts were for sexual assault; the remaining six counts were for felony incest. The trial court sentenced Najera to consecutive sentences for sexual assault and incest. Najera appealed, contending that the convictions for sexual assault and incest should merge for sentencing purposes. The Wyoming Supreme Court agreed and reversed the trial court, holding that the convictions merged and that Najera should serve his sentences concurrently.
This case note advances three arguments to illustrate that the Wyoming Supreme Court must revisit the merger analysis applied in Najera. First, the court's application of the merger test parallels a test that the United States Supreme Court overruled. Second, the Wyoming Supreme Court based the policy justification and structure of its merger analysis on Pennsylvania law that as subsequently abandoned. Finally, the correct merger analysis represents a tool of statutory construction used to determine whether the legislature intended to create distinct offenses. The merger analysis applied in Najera must be revisited.
Number of Pages in PDF File: 24
Keywords: double jeopardy, merger of sentences, Wyoming, Blockburger
Date posted: April 5, 2013
© 2016 Social Science Electronic Publishing, Inc. All Rights Reserved.
This page was processed by apollobot1 in 2.281 seconds