32. Pattern matching (coincidencia de patrones) una introducción - #29
Open
NolascoAyalaGael-07 wants to merge 7 commits into
Open
32. Pattern matching (coincidencia de patrones) una introducción#29NolascoAyalaGael-07 wants to merge 7 commits into
NolascoAyalaGael-07 wants to merge 7 commits into
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Este Pull Request agrega la investigación individual sobre el tema “Pattern matching (coincidencia de patrones): una introducción”, correspondiente a la materia Programación Lógica y Funcional.
El documento incluye:
Introducción al concepto de coincidencia de patrones.
Explicación de su funcionamiento en la programación funcional.
Tipos de patrones: literales, variables, comodines, listas, tuplas, constructores y guardas.
Ejemplos funcionales en Haskell y Elixir.
Ejemplo comparativo en C#.
Diagrama explicativo mediante Mermaid.
Tablas comparativas.
Ventajas, limitaciones y aplicaciones prácticas.
Comparación con las estructuras if y switch.
Conclusiones.
Bibliografía en formato IEEE.
Datos del estudiante al inicio del documento.
Archivo anexo.md con la bitácora y reflexión sobre el uso de inteligencia artificial.
Datos del estudiante
Nombre: Gael Nolasco Ayala
Número de control: 23212031
Carrera: Ingeniería en Sistemas Computacionales
Grupo: SC7C
Materia: Programación Lógica y Funcional
Profesor: Rene Solis Reyes